Problem:
Score : 500 points

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).

Sample Input 1

4 2
1 2 -3 -4

Sample 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.

Sample Input 2

4 3
-1 -2 -3 -4

Sample 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.

Sample Input 3

2 1
-1 1000000000

Sample Output 3

1000000000

The possible products of the one chosen element are -1 and 1000000000, so the maximum product is 1000000000.

Sample Input 4

10 10
1000000000 100000000 10000000 1000000 100000 10000 1000 100 10 1

Sample Output 4

999983200

Be sure to print the product modulo (10^9+7).

Solution in JavaScript (Node.js 12.16.1) (judge verdict: Wrong Answer)

function Main(input) {
    var C = 1e+9 + 7;
    var C2 = 1e+5;
    input = input.trim().split("\n").map(function(x) { return x.split(" ")});
    var N = parseInt(input[0][0], 10);
    var K = parseInt(input[0][1], 10);
    var vec_A = input[1].map(e => parseInt(e, 10));
    vec_A.sort((a, b) => Math.abs(b) - Math.abs(a));

    var ans = calc(vec_A, N, K, C, C2);
    console.log(mod(ans, C));

}

function calc(vec_A, N, K, C, C2){
    var ans = 1;
    var minusCount = 0;
    var minPlus;
    var minMinus;
    for (var i = 0; i < K; i++){
        ans = kakeruR(ans, vec_A[i], C, C2);
        if (ans === 0) return 0
        if (vec_A[i] > 0) minPlus = i;
        if (vec_A[i] < 0) {
            minMinus = i;
            minusCount ++;
        }
    }
    if (K === N) return ans;
    if (minusCount % 2 === 0) return ans;

    if (minusCount < K) {
        // console.log("here", minMinus, minPlus);
        var tmp01 = [0, -1];
        var tmp02 = [0, -1];
        for (var i = K; i < N; i++){
            if (vec_A[i] < 0){
                tmp01 = [vec_A[i] / vec_A[minPlus], i];
                break;
            }
        }
        for (var i = K; i < N; i++){
            if (vec_A[i] > 0){
                tmp02 = [vec_A[i] / vec_A[minMinus], i];
                break;
            }
        }
        if (tmp01[0] < tmp02[0]){
            
            vec_A.splice(K, tmp01[1] - K);
            vec_A.splice(minPlus, 1);
        } else {
            vec_A.splice(K, tmp02[1] - K);
            vec_A.splice(minMinus, 1);
        }
        // console.log(vec_A);
        
        ans = 1;
        for (var i = 0; i < K; i++){
            ans = kakeruR(ans, vec_A[i], C, C2);
            if (ans === 0) return 0
        }
        return ans;
    } else {
        // console.log("there");
        for (var i = K; i < N; i++){
            if (vec_A[i] >= 0){
                vec_A.splice(K, i - K);
                vec_A.splice(minMinus, 1);
                ans = 1;
                for (var i = 0; i < K; i++){
                    ans = kakeruR(ans, vec_A[i], C, C2);
                    if (ans === 0) return 0
                }   
                return ans;
            }
        }
        // console.log("reached?");
        ans = 1;
        for (var i = N - 1; i >= (N - K); i--){
            ans = kakeruR(ans, vec_A[i], C, C2);
        }
        return ans;
    }
}

function kakeruR(a, b, C, C2){
	var tmpQ, tmpR, ans;
  	tmpQ =  (b / C2 | 0);
    tmpR =  b - (tmpQ * C2);
    ans = (a * tmpQ % C) * C2 % C + (a * tmpR);
  	ans %= C;
  return ans;
}

function mod(i, j) {
    return (i % j) < 0 ? (i % j) + 0 + (j < 0 ? -j : j) : (i % j + 0);
}

Main(require("fs").readFileSync("/dev/stdin", "utf8"));