Pagini recente » Cod sursa (job #2614276) | Cod sursa (job #2506132) | Cod sursa (job #1031923) | Borderou de evaluare (job #2016256) | Cod sursa (job #951759)
Cod sursa(job #951759)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("interclasari.in");
ofstream cout("interclasari.out");
int t, n, s;
vector<int> v;
int main()
{
for(cin >> t ; t ; --t)
{
int n;
cin >> n;
s += n;
for(int i = 1 ; i <= n ; ++ i)
{
int x;
cin >> x;
v.push_back(x);
}
}
stable_sort(v.begin(), v.end());
cout << s << "\n";
for(vector<int> :: iterator i = v.begin(), gin = v.end(); i!=gin ; ++i)
cout << *i << " ";
cin.close();
cout.close();
return 0;
}