UVa-11991 https://uva.onlinejudge.org/external/119/p11991.pdf

11991.cpp

#include <iostream>
#include <vector>
#include <memory>

int main()
{
    using namespace std;
    
    while (true) {
        int n, m;
        cin >> n >> m;
        if (cin.eof())
            break;
            
        static unique_ptr< vector<int> > occurence[1000000];
        for (auto &e : occurence)
            e.release();
            
        int i = 0;
        while (n--) {
            int u;
            cin >> u;
            --u;
            
            if (!occurence[u])
                occurence[u].reset(new vector<int> {++i});
            else
                occurence[u]->push_back(++i);
        }

        while (m--) {
            unsigned int k, v;
            cin >> k >> v;
            --k;
            --v;
            
            if (!occurence[v] || occurence[v]->size() <= k)
                cout << '0' << endl;
            else
                cout << occurence[v]->at(k) << endl;
        }
    }
    
    return 0;
}