-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathc.cpp
More file actions
46 lines (41 loc) · 1.01 KB
/
Copy pathc.cpp
File metadata and controls
46 lines (41 loc) · 1.01 KB
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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.end()
#define vprint(v) for(auto e:v){cout<<e<<" ";};cout<<endl;
#define vvprint(vv) for(auto v:vv){vprint(v)};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll N, Q;
cin >> N >> Q;
vll a(N);
rep(i, N) cin >> a[i];
vll x(Q), k(Q);
rep(i, Q) cin >> x[i] >> k[i];
map<ll, vll> m;
rep(i, N){
m[a[i]].push_back(i+1);
}
rep(i, Q){
if(m.find(x[i])!=m.end()){
if(m[x[i]].size()>=k[i]){
cout << m[x[i]][k[i]-1] << endl;
}
else{
cout << -1 << endl;
}
}
else{
cout << -1 << endl;
}
}
}