Okay fine u can use dynamic programming here
here is the code
int arr[k+1];
for(int i=0;i<=k;i++)
arr[i]=0;
int inp[n+1];
for(int i=0;i<n;i++){
cin>>inp[i];
arr[inp[i]]++;
}
for(int i=1;i<=k;i++){
arr[i]+=arr[i-1];
}
// let q be the queries;
cin>>q;
while(q--){
int a , b;
cin>>a>>b;
cout<<arr[b]-arr[a-1]<<"\n";
}