UVA11991——Easy Problem from Rujia Liu?（map+vector）

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

---

 

 

分析：给你一个数组，要求查询某个数第某次出现的位置

 

 

源码：

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<ctype.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<math.h>
#include<vector>
#include<map>
#include<deque>
#include<list>
using namespace std;
int main()
{
    int n,k;
    int x,y;
    int w;
    map<int,vector<int> >m;//每个键对应一个数组
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        m.clear();
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&w);
            m[w].push_back(i);
        }
        for(int i=0; i<k; i++)
        {
            scanf("%d%d",&x,&y);
            if(m[y].size()<x)
                printf("0\n");
            else
                printf("%d\n",m[y][x-1]);
        }
    }

    return 0;
}