Envío 1235

Código

#include <iostream>
#include <bits/stdc++.h> 

using namespace std;

int main()
{
    int n;
    int c;
    cin>>n;
    long nums[n];
    for(int i=0;i<n;i++ )
    {
        cin >> nums[i];
    }
    int n1 = sizeof(nums)/sizeof(nums[0]); 
  
    sort(nums, nums+n1); 
    cin >> c;
    long query;
    for(int i=0;i<c;i++ )
    {
        cin >> query;
        int count=0;
        for (int j = 0; j < n; j++) {
            if(nums[j] > query)
            {
                count = n-j;
                break;
            }
                
        }
        cout << count<<endl;;
    }
    
    return 0;
}