Two ways(Similar):
#include<bits/stdc++.h>
#define MAX 751
using namespace std;
struct node
{
int sum;
int last;
node(int sum,int last):sum(sum),last(last){}
bool operator < (const node& a)const
{
return sum>a.sum;
}
};
int a[MAX][MAX],k;
void merge(int *a,int *b)
{
priority_queue<node> pq;
for(int i=0;i<k;i++)
pq.push(node(a[i]+b[0],0));
for(int i=1;i<k;i++)
{
node ita=pq.top();
pq.pop();
a[i-1]=ita.sum;
ita.sum=ita.sum-b[ita.last]+b[++ita.last];
pq.push(ita);
}
a[k-1]=pq.top().sum;
}
int main()
{
while(scanf("%d",&k)!=EOF)
{
for(int i=0;i<k;i++)
{
for(int j=0;j<k;j++)
scanf("%d",&a[i][j]);
sort(a[i],a[i]+k);
}
for(int i=1;i<k;i++)
merge(a[0],a[i]);
for(int i=0;i<k;i++)
printf("%d%c",a[0][i],i==k-1?'\n':' ');
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main() {
int k;
while (cin >> k) {
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> >> tmp;
vector<vector<int>> a(k + 1, vector<int>(k + 1));
for (int i = 0; i < k; i++) {
for (int j = 1; j <= k; j++) cin >> a[i][j];
sort(a[i].begin() + 1, a[i].begin() + k + 1);
if (i!=0){
// Sorting
for (int j = 1; j <= k; j++) tmp.push(make_pair(a[0][j]+a[i][1], 1));
int place=1;
pair<int, int> small;
for (int j=1;j<=k;j++) {
small=tmp.top();
tmp.pop();
int sum = small.first, id = small.second;
a[0][j]=sum;
tmp.push(make_pair(sum-a[i][id]+a[i][id+1], id+1));
}
// Clearing tmp
while (!tmp.empty()) tmp.pop();
}
}
// Print
cout<<a[0][1];
for (int i=2;i<=k;i++) cout<<" "<<a[0][i];
cout<<endl;
}
}