Pagini recente » Cod sursa (job #3245696) | Cod sursa (job #2243782) | Cod sursa (job #1965454) | Cod sursa (job #2688465) | Cod sursa (job #2124723)
#include <iostream>
#include <fstream>
using namespace std;
int k, n[22], v[22][1000002], m;
int main()
{
ifstream fin ("interclasari.in");
ofstream fout ("interclasari.out");
fin >> k;
for(int e = 1; e <= k; e++)
{
fin >> n[e];
for(int i = 1; i <= n[e]; i++)
{
fin >> v[e][i];
}
v[e][0] = 1;
m += n[e];
}
fout << m << "\n";
for(int i = 1; i <= m; i++)
{
int mi = -1, p;
for(int j = 1; j <= k; j++)
if(v[j][0] <= n[j] && v[j][v[j][0]] < mi || mi == -1)
{
mi = v[j][v[j][0]];
p = j;
}
v[p][0]++;
fout << mi << " ";
}
return 0;
}