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: Runtime Error)

import java.util.*;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int k = sc.nextInt();
    long MOD = (long)Math.pow(10, 9) + 7;
    ArrayList<Long> list1 = new ArrayList<Long>();
    ArrayList<Long> list2 = new ArrayList<Long>();
    for(int i = 0; i < n; i++) {
      long a = sc.nextLong();
      if(a >= 0) {
        list1.add(a);
      } else {
        list2.add(a);
      }
    }
    Collections.sort(list1);
    Collections.sort(list2);
    long ans = 1;
    int p1 = list1.size() - 1;
    int p2 = 0;
    if(list1.size() == 0) {
      if((k % 2) == 1) {
        for(int i = list2.size() - 1; i >= list2.size() - k; i--) {
          long d = list2.get(i);
          d += MOD;
          ans = (ans * d) % MOD;
        }
      } else {
        for(int i = 0; i < k; i++) {
          long d = list2.get(i);
          d += MOD;
          ans = (ans * d) % MOD;
        }
      }
    } else if(list2.size() == 0) {
      for(int i = list1.size() - 1; i >= list1.size() - k; i--) {
        ans = (ans * list1.get(i)) % MOD;
      }
    } else {
    
    for(int i = 0; i < k; i++) {
      if(p2 < list2.size() - 1) {
        long s1 = list1.get(p1);
        if(p1 > 0) s1 *= list1.get(p1 - 1);
        long s2 = list2.get(p2) * list2.get(p2 + 1);
        if((s1 >= s2) || (i == (k - 1))) {
          ans = (ans * list1.get(p1)) % MOD;
          p1--;
        } else {
          s2 = (s2 % MOD);
          ans = (ans * s2) % MOD;
          i++;
          p2 = p2 + 2;
        }
      } else {
        if(p1 >= 0) {
          long d = list1.get(p1);
          ans = (ans * d) % MOD;
          p1--; 
        } else {
          long d = list2.get(p2);
          d += MOD;
          ans = (ans * d) % MOD;
          p2++; 
        }
      }
    } 
    }
    System.out.println(ans);
  }
}