Cod sursa(job #2913910)
| Utilizator | Data | 17 iulie 2022 21:15:13 | |
|---|---|---|---|
| Problema | Interclasari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("interclasari.in");
ofstream out ("interclasari.out");
int main()
{
int n;
in >> n;
priority_queue<int, vector<int>, greater<int>>pq;
while (n--)
{
int m;
in >> m;
for (int i=1; i<=m; i++)
{
int x;
in >> x;
pq.push(x);
}
}
out << pq.size() << '\n';
while (!pq.empty())
out << pq.top() << ' ', pq.pop();
return 0;
}
