4
You can use library functions to solve
1#include <cstdio>2#include <algorithm>3 using namespacestd;4 5 intn, m, k;6 intnum[1000002];7 8 intMainintargcChar Const*Argv[])9 {Ten while(SCANF ("%d", &n)! =EOF) { one for(inti =0; I < n; i++) { ascanf"%d",&num[i]); - } -scanf"%d",&m); the while(m--) { -scanf"%d",&k); - intAns = upper_bound (num, num+n, k)-lower_bound (num, num+n, k); -printf"%d\n", ans); + } - } + return 0; a}
Would have thought it would be quicker, but not
1#include <cstdio>2#include <algorithm>3 using namespacestd;4 5 intn, m, k;6 intnum[1000002];7 8 intMainintargcChar Const*Argv[])9 {Ten while(SCANF ("%d", &n)! =EOF) { one for(inti =0; I < n; i++) { ascanf"%d",&num[i]); - } -scanf"%d",&m); the while(m--) { -scanf"%d",&k); - intLow = Lower_bound (num, num+n, k)-num; - intAns =0; + for(inti = low; I < n && (num[i] = = k); i++) { -ans++; + } aprintf"%d\n", ans); at } - } - return 0; -}