UVA - 11991 Easy Problem from Rujia Liu?(map)

#include<iostream>
#include<map>
#include<vector>
using namespace std;

int main()
{
	int n,m,key,v;
	unsigned k;
	while(cin>>n>>m)
	{
		map<int, vector<int> > date;
		for(int i=1;i<=n;i++)
		{
			cin>>key;
			if(!date.count(key))
				date[key]=vector<int>();
			date[key].push_back(i);
		}
		for(i=0;i<m;i++)
		{
			cin>>k>>v;
			if(!date.count(v)||k>date[v].size())
				cout<<0<<endl;
			else 
				cout<<date[v][k-1]<<endl;
		}
	}
	return 0;
}

#include<cstdio>  
#include<map>  
#include<vector>  
using namespace std;  
map<int ,vector<int> > mm;  
int main(){  
    int n,m,a, k,v;  
    while(scanf("%d%d",&n,&m)==2){  
        mm.clear();  
        for(int i=1;i<=n;i++){  
            scanf("%d",&a);  
            mm[a].push_back(i);  
        }  
        while(m--){  
           scanf("%d%d",&k,&v);  
           if(mm[v].size()<k) printf("0\n");  
           else   printf("%d\n",mm[v][k-1]);  
        }  
    }  
    return 0;  
  
}