Cod sursa(job #2094908)
Utilizator | Data | 26 decembrie 2017 18:30:26 | |
---|---|---|---|
Problema | Interclasari | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
int N, K, x;
priority_queue<int> timeline;
int main()
{
freopen("interclasari.in", "r", stdin);
freopen("interclasari.out", "w", stdout);
scanf("%d", &N);
for(int i = 0; i < N; i++)
{
scanf("%d", &K);;
for(int i = 0; i < K; i++)
{
scanf("%d", &x);
timeline.push(-x);
}
}
printf("%d\n", timeline.size());
while(!timeline.empty())
{
printf("%d ", -timeline.top());
timeline.pop();
}
return 0;
}