Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define ll long long
- ll ar[100100];
- int main(){
- ll n;
- cin >> n;
- for(int i=0;i<n;i++)
- cin >> ar[i];
- sort(ar, ar + n);
- ll *p = ar;
- ll q;
- cin >> q;
- while(q--){
- ll x;
- cin >> x;
- cout << upper_bound(ar,ar+n,x) - p << endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement