UVA 11991 求第k个数值为v的下标

#include<cstdio>
#include<iostream>
#include<queue>
#include<string>
#include<math.h>
#include<stack>
#include<cstdlib>
#include<map>
#include<vector>
#include<algorithm>
#include<cctype>
#include<sstream>

typedef long long ll;
using namespace std; 

int a[100005];
int n,m;
map<int,vector<int> > index;
void input(){
    index.clear();
    for(int i = 0 ; i < n ; i ++){
        int x;
        scanf("%d",&x);
        index[x].push_back(i+1);    // vector存放下标    
    }
}

void solve(){
    for(int i = 0 ; i < m ; i ++){
        int k,v;  // v的第k个 
        scanf("%d%d",&k,&v);
        if(index.count(v) == 0) printf("0\n");            // index.count(v):是否有v 
        else if(k > index[v].size())    printf("0\n"); //index[v].size() :有几个v   
        else printf("%d\n",index[v][k-1]);
    }
}

int main(){
    while(scanf("%d%d",&n,&m) != EOF){
        input();
        solve();
    }
    return 0;
}