Pagini recente » Cod sursa (job #1579701) | Cod sursa (job #2730993) | Cod sursa (job #2400311) | Cod sursa (job #189685) | Cod sursa (job #2089431)
#include<fstream>
using namespace std;
ifstream f("reuniune.in");
ofstream g("reuniune.out");
int main()
{
unsigned long long a[1001],b[1001],c[2001],m,n,i,j,k;
f>>n>>m;
for(i=1;i<=n;i++) f>>a[i];
for(i=1;i<=m;i++) f>>b[i];
k=0;
i=1,j=1;
while(i<=n && j<=m)
if(a[i]<b[j]) c[++k]=a[i++];
else if(a[i]>b[j])c[++k]=b[j++];
else c[++k]=a[i],i++,j++;
while(i<=n) c[++k]=a[i++];
while(j<=m) c[++k]=b[j++];
for(i=1;i<=k;i++) g<<c[i]<<" ";
return 0;
}