Pagini recente » Cod sursa (job #2182849) | Cod sursa (job #390856) | Cod sursa (job #696321) | Cod sursa (job #461840) | Cod sursa (job #2357235)
#include <iostream>
#include <fstream>
using namespace std;
#define MAX 1025
int lm,a[MAX],b[MAX],c[MAX],d[MAX],n,m;
int main(){
ifstream f("cmlsc.in");
ofstream g("cmlsc.out");
f >>n>>m;
for(int i = 1; i<=n; ++i)
f>>a[i], c[a[i]]++;
for(int j = 1; j<=m; ++j)
f>>b[j], d[b[j]]++;
for(int i = 1; i<=MAX; ++i)
if(c[i] == d[i])
lm+=c[i];
else if(c[i]>d[i])
lm+=d[i];
else lm+=c[i];
g<<lm<<endl;
for(int i = 1; i<=MAX; ++i)
if(c[i]==d[i])
while(c[i])g<<i<<" ",c[i]--;
else if(c[i]>d[i])
while(d[i])g<<i<<" ",d[i]--;
else while(c[i])g<<i<<" ",c[i]--;
return 0;}