Cod sursa(job #2357238)

Utilizator StefanUUngureanu Stefan Cristian StefanU Data 27 februarie 2019 11:01:40
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include <iostream>
#include <fstream>
using namespace std;
#define MAX 1025
int lm,a[MAX],b[MAX],c[257],d[257],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<=257; ++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<=257; ++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;}