P1631 序列合并

#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;

int a[100010];
int b[100010];
int p[100010];

bool operator >(pair<int, int>a, pair<int, int>b)
{
    return a.first > b.first;
}

priority_queue<pair<int,int>, vector<pair<int,int>>,greater<pair<int,int>>>heap;

int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        p[i] = 2;
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> b[i];
    }
    for (int i = 1; i <= n; i++)
    {
        heap.push(pair<int, int>(a[1] + b[i], i));
    }
    for (int i = 1; i <= n; i++)
    {
        cout << heap.top().first << " ";
        if (p[heap.top().second] <= n) heap.push(pair<int, int>(a[p[heap.top().second]++] + b[heap.top().second], heap.top().second));
        heap.pop();
    }
}