Pagini recente » Cod sursa (job #2209262) | Cod sursa (job #1515300) | Cod sursa (job #1226488) | Cod sursa (job #228158) | Cod sursa (job #2097402)
#include <cstdio>
#include <queue>
using namespace std;
priority_queue <long long> v;
int main()
{
FILE *fin=fopen ("interclasari.in","r");
FILE *fout=fopen ("interclasari.out","w");
int k,n,s=0;
long long x;
fscanf (fin,"%d",&k);
for (;k;k--){
fscanf (fin,"%d",&n);
s+=n;
for (;n;n--){
fscanf (fin,"%lld",&x);
v.push (-x);
}
}
fprintf (fout,"%d\n",s);
while (v.size()){
fprintf (fout,"%lld ",-v.top());
v.pop();
}
return 0;
}