AtCoder Beginner Contest 173
翻译中…
Problem Statement
翻译中…
Given are $N$ integers $A_1,\ldots,A_N$.
翻译中…
We will choose exactly $K$ of these elements. Find the maximum possible product of the chosen elements.
翻译中…
Then, print the maximum product modulo $(10^9+7)$, using an integer between $0$ and $10^9+6$ (inclusive).
翻译中…
Constraints
翻译中…
$1 \leq K \leq N \leq 2\times 10^5$$|A_i| \leq 10^9$
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N K
A_1 \ldots A_N翻译中…
Output
翻译中…
Print the maximum product modulo $(10^9+7)$, using an integer between $0$ and $10^9+6$ (inclusive).
翻译中…
样例
Input #1
4 2
1 2 -3 -4
Output #1
12
The possible products of the two chosen elements are $2$, $-3$, $-4$, $-6$, $-8$, and $12$, so the maximum product is $12$.
Input #2
4 3
-1 -2 -3 -4
Output #2
1000000001
The possible products of the three chosen elements are $-24$, $-12$, $-8$, and $-6$, so the maximum product is $-6$.
We print this value modulo $(10^9+7)$, that is, $1000000001$.
Input #3
2 1
-1 1000000000
Output #3
1000000000
The possible products of the one chosen element are $-1$ and $1000000000$, so the maximum product is $1000000000$.
Input #4
10 10
1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1
Output #4
999983200
Be sure to print the product modulo $(10^9+7)$.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。