UVA 11991 Easy Problem from Rujia Liu?（vector map）

Easy Problem from Rujia Liu?

Though Rujia Liu usually sets hard problems for contests (for example, regional contests like Xi'an 2006, Beijing 2007 and Wuhan 2009, or UVa OJ contests like Rujia Liu's Presents 1 and 2), he occasionally sets easy problem (for example, 'the Coco-Cola Store' in UVa OJ), to encourage more people to solve his problems :D

Given an array, your task is to find the k-th occurrence (from left to right) of an integer v. To make the problem more difficult (and interesting!), you'll have to answer m such queries.

Input

There are several test cases. The first line of each test case contains two integers n, m(1<=n,m<=100,000), the number of elements in the array, and the number of queries. The next line contains n positive integers not larger than 1,000,000. Each of the following m lines contains two integer k and v (1<=k<=n, 1<=v<=1,000,000). The input is terminated by end-of-file (EOF). The size of input file does not exceed 5MB.

Output

For each query, print the 1-based location of the occurrence. If there is no such element, output 0 instead.

Sample Input

8 4
1 3 2 2 4 3 2 1
1 3
2 4
3 2
4 2

Output for the Sample Input

2
0
7
0

 

题目大意：给出一个包含n个整数的数组，你需要回答若干询问。每次询问两个整数k和v，输出从左到右第k个v的下标（数组下标从左到右编号为1~n）

代码如下：

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

map<int, vector<int> > a; // 最后两个>不要连写，否则会被误认为>>

int main() {
  int n, m, x, y;
  while(scanf("%d%d", &n, &m) == 2) {
    a.clear();
    for(int i = 0; i < n; i++) {
      scanf("%d", &x); if(!a.count(x)) a[x] = vector<int>();
      a[x].push_back(i+1);
    }
    while(m--) {
      scanf("%d%d", &x, &y);
      if(!a.count(y) || a[y].size() < x) printf("0
");
      else printf("%d
", a[y][x-1]);
    }
  }
  return 0;
}