Cod sursa(job #951391)
| Utilizator | Data | 20 mai 2013 14:26:10 | |
|---|---|---|---|
| Problema | Interclasari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("interclasari.in");
ofstream out("interclasari.out");
int v[20000010],n,i,k,x;
int main()
{
in>>k;
i=1;
while(k)
{
in>>x;
n=n+x;
for(;i<=n;i++)
in>>v[i];
k--;
}
sort(v+1,v+n+1);
out<<n<<'\n';
for(i=1;i<=n;i++)
out<<v[i]<<" ";
out<<'\n';
in.close();
out.close();
return 0;
}
