Pagini recente » Cod sursa (job #76858) | Cod sursa (job #2095933) | Cod sursa (job #524001) | Cod sursa (job #1555327) | Cod sursa (job #2038923)
#include <fstream>
#include <queue>
using namespace std;
ifstream fin ("interclasari.in");
ofstream fout("interclasari.out");
priority_queue <int> q;
int main()
{
int k, L, x, cnt = 0;
fin >> k;
for(int i = 1; i <= k; ++i)
{
fin >> L;
cnt += L;
for(int j = 1; j <= L; ++j)
{
fin >> x;
q.push(-x);
}
}
fout << cnt << '\n';
while(!q.empty())
{
fout << -q.top() << " ";
q.pop();
}
return 0;
}