UV 11991-easy problem from rujia Liu?

This question indicates the number of N input, and the number of M groups. Each group contains two integer k and V, which indicates the position where the integer v appears at the K th time.

# Include <cstdio> # include <map> # include <vector> using namespace STD; int main () {Map <int, vector <int> mm; // here we use the map and vector int n, m, K, V, I, A; while (scanf ("% d", & N, & M )! = EOF) {mm. clear (); for (I = 1; I <= N; I ++) {scanf ("% d", & A); mm [A]. push_back (I) ;}while (M --) {scanf ("% d", & K, & V); If (Mm [v]. size () <k) printf ("0 \ n"); else printf ("% d \ n", Mm [v] [k-1]) ;}} return 0 ;}

CodeIt's easy to understand. It's mainly about map and vector usage.