P1918听灌多

#include<iostream>
#include<algorithm>
using namespace std;
long long n,q,b;
struct s{
	long long sum,num;
};
s a[100005];
bool cmp(s x,s y) {
	return x.sum<y.sum;
}
int main() {
	cin >> n;
	for(int i=1;i<=n;i++) {
		cin >> a[i].sum;
		a[i].num=i;
	}
	sort(a+1,a+n+1,cmp);
	cin >> q;
	for(int i=1;i<=q;i++) {
		cin >> b;
		long long l=1,r=n,mid;
		while(l<r) {
			mid=(l+r)>>1;
			if(a[mid].sum<=b) l=mid+1;
			else r=mid;
		}
		if(a[mid].sum==b) cout << a[mid].num << endl;
		else cout << 0<<endl;
	}
	return 0;
}