Envío 6833

Código

#include <bits/stdc++.h>

const int max = 1e6;
long long int A[max];
using namespace std;
void solucion1(){
    long long N;
    cin>>N;
    for (int i = 0; i < N ; ++i) {
        cin>>A[i];
    }
    int t;
    cin>>t;

    while(t--){
        int x,ans;
        cin>>x;
        bool vand = false;
        for (int i = 0; i < N; ++i) {
            if(A[i]>x) {
                ans = i;
                vand = true;
                break;
            }
        }

        if(vand)
            cout<<ans<<endl;
        else
            cout<<N<<endl;

    }

}


void solucion2(){
    long long N;
    cin>>N;
    for (int i = 0; i < N ; ++i) {
        cin>>A[i];
    }
    int t;
    cin>>t;

    while(t--){
        int x,ans = int(N);
        cin>>x;
        int inicio = 0;
        int final = int(N);

        while(inicio<final){
            int med = (inicio + final)/2;
            if(A[med]<=x){
                inicio = med+1;
            }
            else{
                ans = med;
                final = med;
            }

        }
        cout<<ans<<endl;
    }


}


int main(){
    solucion2();



    return 0;
}