Cod sursa(job #950402)
| Utilizator | Data | 16 mai 2013 19:21:30 | |
|---|---|---|---|
| Problema | Interclasari | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream f("interclasari.in");
ofstream g("interclasari.out");
long k, n, sol=0, x, maxim=-1;
bitset <30000010> v;
int main()
{
f>>k;
for (int aux=1; aux<=k; aux++)
{
f>>n; sol+=n;
for (int i=1; i<=n; i++)
{
f>>x; v[x]=1;
if (x>maxim) maxim=x;
}
}
g<<sol<<'\n';
for (int i=0; i<=maxim+1; i++)
if (v[i]) g<<i<<' ';
f.close(); g.close();
return 0;
}
