uva 11997

首次學習PQ這麼精銳的題目

//============================================================================
// Name        : K Smallest Sums.cpp
// Date : 2013/5/5 上午2:51:02
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 800
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int a[M][M];
int n;
struct data{
    int sum,now;
    bool operator<(const data &d)const{
        return sum>d.sum;
    }
    data(int ss,int nn):sum(ss),now(nn){};
};
void solve(){
    for(int i=1;i<n;i++){
        priority_queue<data> pq;
        for(int k=0;k<n;k++){
            pq.push(data(a[0][k]+a[i][0],0));
        }
        for(int j=0;j<n;j++){
            data d=pq.top();pq.pop();
            int nowt=d.now;
            int sumt=d.sum;
            a[0][j]=sumt;
            if(nowt+1<n){
                pq.push(data(sumt-a[i][nowt]+a[i][nowt+1],nowt+1));
            }
        }
    }
}
bool cmp(int a,int b){
    return a<b;
}
int main() {
    ios_base::sync_with_stdio(0);
    while(~scanf("%d",&n)){
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                scanf("%d",&a[i][j]);
            }
            sort(&a[i][0],&a[i][0]+n,cmp);
        }
        solve();
        for(int i=0;i<n-1;i++)printf("%d ",a[0][i]);
        printf("%d\n",a[0][n-1]);
    }

















}