SEM 2 - W4 |
Старт: 28.мар.2023 в 16:41:52
Финиш: 04.апр.2023 в 20:41:52
Турнир завершён!
• Турнирная таблица
|
|
Лимит времени 2000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Given N integers. You are asked to choose two of them such that whose product is maximum.
Input
Firstly, N - the number of numbers in sequence (2 <= N <= 100). Further, the sequence is written: N of integers which are less than 1000.
Output
Bring out the two unknown numbers in any order.
If there are several different pairs of numbers that give
the maximum product, then bring out any of them.
|
input 1
|
Input 2
|
9
3 5 1 7 9 0 9 -3 10
|
3
-5 -300 -12
|
|
Output 1
|
Output 2
9 10
|
-300 -12
| |
Для отправки решений необходимо выполнить вход.
|