code vs 1245 最小的N个和

#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define MAXN 200001
using namespace std;
int n,num;
int a[MAXN],b[MAXN];
struct nond{
    int x,y;
    bool operator < (nond b) const{
        return x>b.x;
    }
}v;
priority_queue<nond>que;
int main(){
    //freopen("hahaha.in","r",stdin);
    //freopen("hahaha.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++){
        scanf("%d",&b[i]);
        v.x=b[i]+a[1];v.y=1;
        que.push(v);
    }
    while(num<n){
        nond now=que.top();
        cout<<now.x<<endl;
        que.pop();
        now.x=now.x-a[now.y]+a[now.y+1];
        now.y+=1;
        que.push(now);
        num++;
    }
}