Pagini recente » Diferente pentru problema/convertor intre reviziile 32 si 29 | Cod sursa (job #2689355) | Cod sursa (job #338452) | Cod sursa (job #1779211) | Cod sursa (job #2382234)
#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();
}
}