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{
    
    static final int MOD = (int)1e9+7;
    
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        
        int n = Integer.parseInt(sc.next());
        int k = Integer.parseInt(sc.next());
        int[] a = new int[n];
        int mlen = 0;
        int plen = 0;
        boolean existZero = false;
        for(int i=0; i<n; i++){
            a[i] = Integer.parseInt(sc.next());
            if(a[i] == 0){
                existZero = true;
            }else if(a[i] < 0){
                mlen++;
            }else{
                plen++;
            }
        }
        
        Arrays.sort(a);
        
        int[] minusArray = new int[mlen];
        int[] plusArray = new int[plen];
        for(int i=0; i<mlen; i++){
            minusArray[i] = a[i];
        }
        for(int i=0; i<plen; i++){
            plusArray[i] = a[n-1-i];
        }
        
        if(!existZero && plen==0 && k%2==1){
            //負のみ、kが奇数
            long ans = 1;
            for(int i=1; i<k; i+=2){
                long tmp = minusArray[mlen-i];
                tmp *= minusArray[mlen-1-i];
                tmp %= MOD;
                ans *= tmp;
                ans %= MOD;
            }
            ans *= minusArray[mlen-k];
            System.out.println((ans+MOD)%MOD);
            return;
        }
        
        long[] multiArray = new long[(mlen+1)/2];
        Arrays.fill(multiArray, 1);
        for(int i=0; i<mlen; i++){
            multiArray[i/2] *= minusArray[i];
        }
        
        long ans = 1;
        int pidx = 0;
        int midx = 0;
        while(k > 0){
            //嬉しい方を掛ける
            long p = 0;
            long m = 0;
            if(pidx < plusArray.length){
                p = plusArray[pidx];
                p = p*p;
            }
            if(midx < multiArray.length){
                m = multiArray[midx];
            }
            if(pidx == plusArray.length && midx == multiArray.length){
                System.out.println(0);
                return;
            }
            if(p < m && k>=2){
                ans *= m%MOD;
                midx++;
                k-=2;
            }else{
                ans *= plusArray[pidx];
                pidx++;
                k--;
            }
            ans %= MOD;
        }
        
        System.out.println(ans);
        
    }
    
}