Pagini recente » Cod sursa (job #837135) | Cod sursa (job #2266318) | Cod sursa (job #2957155) | Cod sursa (job #235361) | Cod sursa (job #1732125)
#include <cstdio>
#include <queue>
using namespace std;
priority_queue < int > Q;
int main()
{
freopen("interclasari.in","r",stdin);
freopen("interclasari.out","w",stdout);
int n, m, i, j, k, s, t, d;
s = 0;
scanf("%d",&m);
while( m-- ){
scanf("%d",&n);
for( i = 1; i <= n; ++i ){
scanf("%d",&d);
Q.push( -d );
}
s += n;
}
printf("%d\n",s);
while( !Q.empty() ){
printf("%d ",-Q.top());
Q.pop();
}
return 0;
}