uva 11991 Easy Problem from Rujia Liu?

水题一道, map应用

#include <stdio.h>#include <map>#include <vector>using namespace std;map<int, vector<int> > record;int main(void){int n, m, i;int num;int k, v;//freopen("input.dat", "r", stdin);while(scanf("%d %d", &n, &m) != EOF){record.clear();for(i=1; i<=n; i++){scanf("%d", &num);record[num].push_back(i);}for(i=1; i<=m; i++){scanf("%d %d", &k, &v);if(k > record[v].size())printf("0\n");else{printf("%d\n", record[v][k-1]);}}}return 0;}