-
Notifications
You must be signed in to change notification settings - Fork 67
/
AGPC01F.cpp
62 lines (56 loc) · 1.37 KB
/
AGPC01F.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
//#include <unordered_map>
#include <list>
#include <bitset>
#include <utility>
#include <cassert>
#include <iomanip>
#include <ctime>
#include <fstream>
#include <bitset>
using namespace std;
const int me = 100025;
int T, N, Q;
int a[me], result[me];
pair<int, int> queries[me];
int main(int argc, const char * argv[]) {
//ios_base::sync_with_stdio(0);
//cin.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
scanf("%d", &T);
while(T --){
scanf("%d%d", &N, &Q);
for(int i = 0; i < N; i ++)
scanf("%d", &a[i]);
for(int i = 0; i < Q; i ++){
scanf("%d", &queries[i].first);
queries[i].second = i;
}
sort(queries, queries + Q);
int ptr = 0, smallest = a[0];
for(int i = 0; i < N; i ++){
smallest = min(smallest, a[i]);
while(ptr < Q && queries[ptr].first <= i + 1){
result[queries[ptr].second] = smallest;
ptr ++;
}
}
for(int i = 0; i < Q; i ++)
printf("%d\n", result[i]);
putchar('\n');
}
return 0;
}