Pagini recente » Cod sursa (job #636797) | Cod sursa (job #597263) | Cod sursa (job #2769727) | Cod sursa (job #674890) | Cod sursa (job #2038975)
#include <bits/stdc++.h>
#include<fstream>
using namespace std;
priority_queue<int> q;
ifstream fin("interclasari.in");
ofstream fout("interclasari.out");
int main()
{
int k ,i,L,cnt=0,j,x;
fin>>k;
for(i=1;i<=k;i++)
{
fin>>L;
cnt+=L;
for(j=1;j<=L;j++)
{
fin>>x;
q.push(-x);
}
}
fout<<cnt<<"\n";
while(!q.empty())
{
fout<<-q.top()<<" ";
q.pop();
}
return 0;
}