Cod sursa(job #1226700)
| Utilizator | Data | 6 septembrie 2014 21:37:13 | |
|---|---|---|---|
| Problema | Interclasari | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream in("interclasari.in");
ofstream out("interclasari.out");
int v[20000009],n,k,poze;
void read()
{
in>>k;
++k;
int i;
while(--k){
in>>n;
for(i = 1 ; i <= n ; i++)
in>>v[++poze];
}
in.close();
}
void write()
{
out<<poze<<"\n";
for(int i = 1 ; i <= poze ; i++)
out<<v[i]<<" ";
out.close();
}
int main()
{
read();
sort(v+1,v+poze);
write();
return 0;
}
