Pagini recente » Cod sursa (job #2658600) | Cod sursa (job #1408999) | Cod sursa (job #1581022) | Cod sursa (job #635293) | Cod sursa (job #629651)
Cod sursa(job #629651)
#include<stdio.h>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;
priority_queue<int> Q;
int N,K,a,NR;
int main()
{
ifstream f("interclasari.in");
ofstream g("interclasari.out");
f >> K;
for(int i=1;i<=K;i++)
{
f >> N;
NR += N;
for(int j=1;j<=N;j++)
{
f >> a;
Q.push(-a);
}
}
g << NR << "\n";
for(;!Q.empty();Q.pop())
g << -Q.top() << " ";
}