Pagini recente » Cod sursa (job #370432) | Cod sursa (job #134017) | Cod sursa (job #1426788) | Cod sursa (job #2609732) | Cod sursa (job #1863915)
#include <fstream>
using namespace std;
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n, m;
int x;
int A[10030];
int B[10030];
int main()
{
fin >> n >> m;
for (int i = 1; i <= n; i++) {
fin >> x;
A[i] = x;
}
for (int i = 1; i <= m; i++) {
fin >> x;
B[i] = x;
}
int i = 1;
int j = 1;
while (i <= n && j <= m) {
if (A[i] == B[j]) {
fout << A[i] << ' ';
i++;
j++;
}
else
if (A[i] < B[j])
i++;
else
j++;
}
if (i > n)
i--;
if (j > m)
j--;
if (i == j) {
return 0;
}
if (i == n)
for (; j <= m; j++)
if (B[j] == A[i])
fout << B[j] << ' ';
if (j == m)
for (; i <= n; i++)
if (A[i] == B[j])
fout << A[i] << ' ';
return 0;
}