猫猫与主人

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e5+100;
struct node{
    ll youshan,y;//x是友善值，y是期望值
}a[N],b[N];//a是猫猫的，b是人的
bool cmp(node l,node r)//结构体排序
{
    if(l.youshan == r.youshan)//友善值相同按期望值低的排序
        return l.y > r.y;
    return l.youshan < r.youshan;//不同按友善值高的排序
}
int n,m;
ll sum[N];
int main(){
    cin >> n >> m;
    for(int i = 1;i <= n;i ++)
        cin >> a[i].youshan;
    for(int i = 1;i <= n;i ++)
        cin >> a[i].y;
    for(int i = 1;i <= m;i ++)
        cin >> b[i].youshan;
    for(int i = 1;i <= m;i ++)
        cin >> b[i].y;

    sort(b+1,b+1+m,cmp);//对主人的友善值的期望值排序
    sum[m + 1] = 1e9;
    for(int i = m;i >= 1;i --) sum[i] = min (sum[i + 1],b[i].y);
    for(int i = 1;i <= n;i ++){
        ll pos = upper_bound(sum + 1,sum + 1 + m,a[i].youshan) - sum;//找到满足人期望友善值的猫的下一个
        pos -= 1;
        if(pos == 0 || b[pos].youshan < a[i].y)cout << "-1 ";//如果没找到或者主人的友善值达不到猫的需求
        else cout << b[pos].youshan << " ";
    }
    return 0;
}