UVA 10474 where is the marble lower_bound

Test instructions: Find the number of inputs in the position after the order is completed.

Mainly the use of lower_bound functions. Its purpose is to find the first position that is greater than or equal to X.

#include <cstdio>#include<algorithm>using namespacestd;Const intMAXN =10000;intMain () {intN,q,x,a[maxn],kase =0;  while(SCANF ("%d%d", &n,&q) = =2&&N) {printf ("case#%d:\n",++Kase);  for(inti =0; i < n; i++) scanf ("%d",&A[i]); Sort (A,a+N);  while(q--) {scanf ("%d",&x); intp = lower_bound (a,a+n,x)-A; if(A[p] = = x) printf ("%d found at%d\n", x,p+1); Elseprintf"%d not found\n", x); }    }    return 0;}

UVA 10474 where is the marble lower_bound