Cod sursa(job #2038923)
Utilizator | Data | 14 octombrie 2017 10:01:31 | |
---|---|---|---|
Problema | Interclasari | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#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;
}