Pagini recente » Cod sursa (job #2608991) | Cod sursa (job #2581030) | Cod sursa (job #1010400) | Cod sursa (job #1332366) | Cod sursa (job #2251254)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("text.in");
unsigned int m, n, a[10001], b[10001], i, j, kk=0, x, k;
f>>m>>n;
for(i=1;i<=m;i++)
{
f>>x;
if(x%2==0)
{
k++;
a[k]=x;
}
}
//primul sir de numere pare cu lungimea k
for(i=1;i<=m;i++)
{
f>>x;
if(x%2==0)
{
kk++;
b[kk]=x;
}
}
//al doilea sir de numere pare cu lungimea kk
i=k;
j=kk;
while(i>0 && j>0)
{
if(a[i]>b[j])
{
cout<<a[i]<<" ";
i--;
}
else
{
if(a[i]==b[i])
{
cout<<a[i]<<" ";
i--;
j--;
}
else
{
cout<<b[j]<<" ";
j--;
}
}
}
for(k=i;k>0;k--)
cout<<a[k]<<" ";
for(k=j;k>0;k++)
cout<<b[k]<<" ";
return 0;
}