Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- long long int arr[200000];
- int main()
- {
- long long int t,i,j,k,a,b,n,q,c,d,e,ans,x,y;
- scanf("%lld",&t);
- for(k=1;k<=t;k++)
- {
- scanf("%lld %lld",&n,&q);
- for(i=0;i<n;i++)
- {
- scanf("%lld",&arr[i]);
- }
- printf("Case %lld:\n",k);
- while(q--)
- {
- scanf("%lld %lld",&a,&b);
- c=lower_bound(arr,arr+n,a)-arr;
- d=upper_bound(arr,arr+n,b)-arr;
- printf("%lld\n",d-c);
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement