Pagini recente » Cod sursa (job #2634441) | Cod sursa (job #576745) | Cod sursa (job #182497) | Cod sursa (job #21214) | Cod sursa (job #1662261)
#include <iostream>
#include <fstream>
#include <queue>
using namespace std;
ifstream in("interclasari.in");
ofstream out("interclasari.out");
class cmp
{
public:
bool operator() (int x, int y) const
{
return x > y;
}
};
priority_queue < int, vector <int>, cmp > H;
int ans;
int N, K;
int main()
{
int i, j, x;
in >> K;
for(i = 1; i <= K; i++)
{
in >> N;
ans += N;
for(j = 1; j <= N; j++)
{
in >> x;
H.push(x);
}
}
out << ans << '\n';
while(!H.empty())
{
x = H.top();
H.pop();
out << x << " ";
}
return 0;
}