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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.*;

public class Main {

  public static void main(String[] args) {
    int n = scanner.nextInt();
    int k = scanner.nextInt();
    int[] A = new int[n];
    for (int i = 0; i < n; i++) {
      A[i] = scanner.nextInt();
    }
    List<Integer> pos = new ArrayList<>();
    List<Integer> neg = new ArrayList<>();
    int mod = 1000000007;
    int zero = 0;
    long all = 1;
    for (int i : A) {
      if (i > 0) {
        pos.add(i);
      } else if (i < 0) {
        neg.add(i);
      } else {
        zero++;
      }
      all = (all * i) % mod;
    }
    if (pos.size() + neg.size() < k || (n == k && zero > 0)) {
      System.out.println(0);
      return;
    }
    if (n == k) {
      System.out.println(Math.floorMod(all, mod));
      return;
    }
    pos.sort(Comparator.reverseOrder());
    neg.sort(Comparator.reverseOrder());
    long[] posMulLft = new long[pos.size() + 1];
    long[] negMulLft = new long[neg.size() + 1];
    long[] negMulRgt = new long[neg.size() + 1];
    posMulLft[0] = 1;
    negMulLft[0] = 1;
    negMulRgt[negMulRgt.length - 1] = 1;
    for (int i = 1; i < posMulLft.length; i++) {
      posMulLft[i] = (posMulLft[i - 1] * pos.get(i - 1)) % mod;
    }
    for (int i = 1; i < negMulLft.length; i++) {
      negMulLft[i] = (negMulLft[i - 1] * neg.get(i - 1)) % mod;
    }
    for (int i = negMulRgt.length - 2; i >= 0; i--) {
      negMulRgt[i] = (negMulRgt[i + 1] * neg.get(i)) % mod;
    }
    long res = Long.MIN_VALUE;
    for (int i = 0; i < Math.min(k + 1, posMulLft.length); i++) {
      if (k - i < negMulLft.length) {
        res = Math.max(res, (posMulLft[i] * negMulLft[k - i]) % mod);
      }
    }
    for (int i = 0; i < Math.min(k + 1, negMulRgt.length); i++) {
      if (k - i < posMulLft.length) {
        res = Math.max(res, (posMulLft[k - i] * negMulRgt[negMulRgt.length - 1 - i]) % mod);
      }
    }
    System.out.println(Math.floorMod(res, mod));
  }

  private static final Scanner scanner = new Scanner(System.in);
}