Pagini recente » Cod sursa (job #822930) | Cod sursa (job #1517871) | Cod sursa (job #1702389) | Cod sursa (job #1593614) | Cod sursa (job #2104945)
#include <cstdio>
#include <queue>
#include <functional>
using namespace std;
priority_queue <int,vector<int>,greater<int>> q;
int main()
{
int i,k,j,n,x;
freopen("interclasari.in","r",stdin);
freopen("interclasari.out","w",stdout);
scanf("%d",&k);
for(i=1; i<=k; i++){
scanf("%d",&n);
for(j=1; j<=n; j++){
scanf("%d",&x);
q.push(x);
}
}
printf("%d\n",q.size());
while(q.size()){
printf("%d ",q.top());
q.pop();
}
return 0;
}