Pagini recente » Cod sursa (job #340814) | Cod sursa (job #2783180) | Cod sursa (job #1142804) | Cod sursa (job #2282489) | Cod sursa (job #2902453)
#include <iostream>
#include <fstream>
#include <algorithm>
#define MAX 20000002
using namespace std;
int n,k,v[MAX],s;
ifstream fin("interclasari.in");
ofstream fout("interclasari.out");
int main()
{
fin >> k;
int ans = 0;
for(int i = 1; i <= k; i++){
fin >> n;
ans += n;
for(int j = 1; j <= n; j++){
fin >> v[++s];
}
}
fout << ans << "\n";
sort(v+1, v+s+1);
for(int i = 1; i <= s; i++){
fout << v[i] << " ";
}
return 0;
}