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.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

public class Main {
    long MOD = 1_000_000_007;

    void solve(Scanner sc, PrintWriter pw) {
        int N = sc.nextInt();
        int K = sc.nextInt();
        List<Long> positive = new ArrayList<>();
        List<Long> negative = new ArrayList<>();
        int zeroCount = 0;
        for (int i = 0; i < N; i++) {
            long data = sc.nextLong();
            if (data == 0) {
                zeroCount++;
            } else if (data > 0) {
                positive.add(data);
            } else {
                negative.add(-1L * data);
            }
        }
        if (K % 2 == 0) {
            int positiveUsable = getEven(positive.size()) + getEven(negative.size());
            if (positiveUsable >= K) {
                positive.sort(Comparator.reverseOrder());
                negative.sort(Comparator.reverseOrder());
                List<Long> total = new ArrayList<>();
                for (int i = 0; i + 1 < positive.size(); i += 2) {
                    total.add(((long) positive.get(i) * positive.get(i + 1)) % MOD);
                }
                for (int i = 0; i + 1 < negative.size(); i += 2) {
                    total.add(((long) negative.get(i) * negative.get(i + 1)) % MOD);
                }
                total.sort(Collections.reverseOrder());
                long result = 1L;
                for (int i = 0; i < K / 2; i++) {
                    result = (result * total.get(i)) % MOD;
                }
                pw.println(result);
            } else {
                if (zeroCount > 0) {
                    pw.println("0");
                } else {
                    List<Long> total = new ArrayList<>();
                    total.addAll(positive);
                    total.addAll(negative);
                    Collections.sort(total);
                    long result = -1L;
                    for (int i = 0; i < K; i++) {
                        result = (result * total.get(i)) % MOD;
                    }
                    pw.println((result + MOD) % MOD);
                }
            }
        } else {
            int positiveUsable = getOdd(positive.size()) + getEven(negative.size());
            if (getOdd(positive.size()) >= 0 && positiveUsable >= K) {
                List<Long> total = new ArrayList<>();
                positive.sort(Comparator.reverseOrder());
                negative.sort(Comparator.reverseOrder());
                long result = positive.get(0);
                for (int i = 1; i + 1 < positive.size(); i += 2) {
                    total.add((positive.get(i) * positive.get(i + 1)) % MOD);
                }
                for (int i = 0; i + 1 < positive.size(); i += 2) {
                    total.add((positive.get(i) * positive.get(i + 1)) % MOD);
                }
                total.sort(Collections.reverseOrder());
                for (int i = 0; i < K / 2; i++) {
                    result = (result * total.get(i)) % MOD;
                }
                pw.println((result + MOD) % MOD);
            } else {
                if (zeroCount > 0) {
                    pw.println("0");
                } else {
                    List<Long> total = new ArrayList<>();
                    total.addAll(positive);
                    total.addAll(negative);
                    Collections.sort(total);
                    long result = -1L;
                    for (int i = 0; i < K; i++) {
                        result = (result * total.get(i)) % MOD;
                    }
                    pw.println((result + MOD) % MOD);
                }
            }
        }
    }

    private int getEven(int size) {
        return size - (size % 2);
    }

    private int getOdd(int size) {
        if (size == 0) {
            return -1;
        }
        return size - ((size % 2) == 0 ? 1 : 0);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        new Main().solve(sc, pw);
        pw.flush();
        pw.close();
        sc.close();
    }
}