Cod sursa(job #1026620)
Utilizator | Data | 11 noiembrie 2013 20:07:15 | |
---|---|---|---|
Problema | Interclasari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("interclasari.in");
ofstream g ("interclasari.out");
int n;
int v[5000001];
void citeste ()
{
int k;
int m;
f>>k;
for (int i=1; i<=k; i++)
{
f>>m;
for (int j=1; j<=m; j++)
{
n++;
f>>v[n];
}
}
}
void scrie ()
{
g<<n<<'\n';
for (int i=1; i<=n; i++) g<<v[i]<<' ';
g<<'\n';
}
int main ()
{
citeste ();
sort (v+1, v+n+1);
scrie ();
return 0;
}