UVA 11991 Easy Problem from Rujia Liu?(map，vector)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define ss(x) scanf("%d",&x)
map<int,vector<int> > ha;
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int x;
        rep(i,1,n){
            ss(x);
            if(!ha.count(x)) ha[x]=vector<int>();
            ha[x].push_back(i);
        }
        int k,v;
        while(m--)
        {
            ss(k);ss(v);
            if(!ha.count(v)) {printf("0\n");continue;}
            if(ha[v].size()<k) printf("0\n");
            else printf("%d\n",ha[v][k-1]);
        }
    }
    return 0;
}