NYOJ 634 万里挑一（优先队列）

 //题目链接
 //http://acm.nyist.net/JudgeOnline/problem.php?pid=634
 1 #include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
int a[100001], b[100001];
struct node{
    int d; int b;
    node(){}
    node(int a, int b):d(a),b(b){}
    bool operator < (const node& tmp) const{
        return d < tmp.d;            //使队列维护从大到小的性质
    }
};
bool cmp(int ta, int tb){
    return ta > tb;
}
void merge(int *A, int *B, int *C, int n){
    priority_queue<node> pq;
    int i;
    for(i = 0; i < n; ++i)
        pq.push(node(A[i] + B[0], 0));   //先入队列n个数（第一个是最大的）
    for(i = 0; i < n; ++i){
        node tmp = pq.top(); pq.pop();   //每次最大的数出队列，并保存到数组C中
        C[i] = tmp.d;
        int b = tmp.b;
        if(b + 1 < n)
            pq.push(node(tmp.d - B[b] + B[b+1], b+1));
            //tmp.d = A[x] + B[b];
            //tmp.d - B[b] + B[b+1] 是小于等于tmp.d的一个数入队
    }
}
int main()
{
    int N, k, i;
    while(scanf("%d%d",&N, &k) != EOF){
        for(i = 0; i < N; ++i) scanf("%d", &a[i]);
        for(i = 0; i < N; ++i) scanf("%d", &b[i]);
        sort(a, a+N, cmp);     //从大到小排序
        sort(b, b+N, cmp);
        merge(a, b, a, k);
        printf("%d", a[k-1]);
        for(i = k-2; i >= 0; --i)
            printf(" %d", a[i]);
        puts("");
    }
    return 0;
}