luogu 1631 序列合并

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i=x;i<=y;i++) 
using namespace std;
const int N=100050;

int a[N],b[N],k[N],n;
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >q;
int main(){
    ios::sync_with_stdio(false);
    cin>>n;
    rep(i,1,n) cin>>a[i];
    rep(i,1,n){
        cin>>b[i];k[i]=1;
        q.push(pair<int,int>(a[i]+b[1],i));
    }while(n--){
        pair<int,int> u=q.top();q.pop(); 
        printf("%d ",u.first);
        int i=u.second;
        q.push(pair<int,int>(a[i]+b[++k[i]],i));
    }return 0;
}