题意:
给定一个数组,查询第k个出现的v的位置
通过map<int, vector<int> >缩短查询时间
#include <iostream>
#include <vector>
#include <map>
#include <list>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <cstring>
#include <queue>
using namespace std;
///宏定义
const int INF = 990000000;
const int maxn = 150 ;
const int MAXN = maxn;
///全局变量 和 函数
int T;
int max(int a, int b)
{
return a > b ? a : b;
}
int n, m;
map<int, vector<int> > dic;
int main()
{
///变量定义
int i, j;
while(scanf("%d %d", &n, &m) != EOF)
{
dic.clear();
for (i = 1; i <= n; i++)
{
int num;
scanf("%d", &num);
if (dic.count(num) == 0)
{
vector<int> arrayNum;
arrayNum.push_back(i);
dic.insert(make_pair(num, arrayNum));
}
else
{
dic[num].push_back(i);
}
}
for (i = 0; i < m; i++)
{
int k, v;
scanf("%d %d", &k, &v);
if (dic.count(v) == 0 || dic[v].size() < k)
{
printf("%d\n", 0);
}
else
{
printf("%d\n", dic[v][k - 1]);
}
}
}
///结束
return 0;
}