ソースコード
#include <iostream>
using namespace std;
long long n;
long long x;
long long q = 0;
long long A = 0;
long long B[500000];
long long con = 0;
long long s = 0;
long long t=0;
void search() {
long long high = n;
long long low = 0;
long long mid = 0;
for (;;) {
mid = (high + low) / 2;
if (B[mid-1] < A && A< B[mid]) {
cout<<n - mid<<endl;
break;
}
if ( A ==B[mid]) {
cout << n - mid << endl;
break;
}
if (B[mid] > A) {
high= mid;
}
if (B[mid] < A) {
low = mid+1;
}
}
}
int main() {
cin >> n;
for (long long i = 0; i < n; ++i) {
cin >> x;
B[i] = x;
}
t = n - 1;
cin >> q;
for (long long t = 0; t < q; ++t) {
cin >> A;
if (B[n - 1] < A) {
cout << 0 << endl;
continue;
}
else {
search();
continue;
}
}
return 0;
}