Pagini recente » Cod sursa (job #2126742) | Cod sursa (job #1127359) | Cod sursa (job #2259896) | Cod sursa (job #2178903) | Cod sursa (job #2094929)
#include <cstdio>
#include <queue>
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;
}