Pagini recente » Cod sursa (job #2004475) | Cod sursa (job #83350) | Cod sursa (job #510183) | Cod sursa (job #3141345) | Cod sursa (job #1424517)
#include <fstream>
#include <set>
using namespace std;
ifstream fin("interclasari.in");
ofstream fout("interclasari.out");
multiset <short int> binaryTree;
int i,j,n,m,nr,ans;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>m;
ans+=m;
for(j=1;j<=m;j++)
{
fin>>nr;
binaryTree.insert(nr);
}
}
fout<<ans<<'\n';
while(binaryTree.size()>1)
{
fout<<*binaryTree.begin()<<" ";
binaryTree.erase(binaryTree.begin());
}
fout<<*binaryTree.begin();
return 0;
}