Cod sursa(job #2382234)
Utilizator | Data | 17 martie 2019 21:47:06 | |
---|---|---|---|
Problema | Interclasari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("interclasari.in");
ofstream out("interclasari.out");
priority_queue <int> Q;
vector <int> a[21];
int k,n,i,j,x;
int main()
{
in>>k;
for (i=1;i<=k;++i)
{
in>>n;
for (j=1;j<=n;++j)
{
in>>x;
Q.push(-x);
}
}
while (Q.size())
{
out<<-Q.top()<<" ";
Q.pop();
}
}