Pagini recente » Cod sursa (job #1842456) | Cod sursa (job #2615631) | Diferente pentru problema/ape intre reviziile 11 si 3 | Cod sursa (job #2509671) | Cod sursa (job #2659735)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <list>
#include <map>
#include <math.h>
#define NMAX 100001
using namespace std;
ifstream f("interclasari.in");
ofstream g("interclasari.out");
multiset<int>s;
int main() {
int n;
int contor =0 ;
f>>n;
while(n--)
{
int m;
f>>m;
contor+=m;
for(int i=1;i<=m;i++)
{
int x;
f>>x;
s.insert(x);
}
}
g<<contor<<'\n';
for(auto it : s)
{
g<<it<<" ";
}
return 0;
}