Дан текст решения
| Python |
Ожидаемый ответ |
n = int (input ( ) )
m = int (input ( ) )
left = [int(input()) for i in range (n)]
right = [int(input()) for i in range (m)]
i = 0
j = 0
while i < len (left):
if j < len(right) and right[j] <= left[i]:
print((left[i] - right[j]) // 2, (left[i] + right[j]) // 2)
i += 1
j += 1
else:
print(0, left[i])
i += 1
while j < len(right):
print(0, right[j])
j += 1
|
|
Напишите аналогичный код на C++