Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- struct nn{
- int x;
- int ind;
- };
- bool cmp(nn a,nn b){
- if(a.x>b.x){
- return a.x>b.x;
- }
- return b.x>a.x;
- }
- int main()
- {
- ios_base::sync_with_stdio(false);
- nn a[100000];
- int ans[100000];
- int n;
- cin>>n;
- for(int i=0;i<n;i++){
- cin>>a[i].x;
- }
- int m;
- cin>>m;
- nn b[100000];
- for(int i=0;i<m;i++){
- cin>>b[i].x;
- b[i].ind=i;
- }
- sort(b,b+m,cmp);
- for(int i=0;i<n;i++){
- int h=((upper_bound(b,b+m,a[i],cmp))-b);
- if(h>0 && (abs(b[h-1].x-a[i].x)<abs(b[h].x-a[i].x))){
- h--;
- }
- ans[i]=b[h].ind+1;
- }
- for(int i=0;i<n;i++){
- cout<<ans[i]<<" ";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement