P1631,上代码

#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
struct node{
    int x,y,v;
    bool operator < (const node& n){
        return this->v>n.v;
    }
};
priority_queue<node> q;
int a[1000000],b[1000000],n;
int main()
{
    cin>>n;
    node e;
    for (int i=0;i<n;i++) cin>>a[i];
    for (int i=0;i<n;i++) cin>>b[i];
    for (int i=0;i<n;i++) {e.x=0;e.y=i;e.v=a[0]+b[i];q.push(e);}
    node d;
    for (int i=0;i<n;i++) {
        d=q.top();
        q.pop();
        cout<<d.v<<' ';
        d.x++;
        d.v=a[d.x]+b[d.y];
        q.push(d);
    }
    return 0;
}