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 Rust (1.42.0) (judge verdict: Runtime Error)

const M: i64 = 1000_000_007;

fn main() {
    proconio::input! {
        n: usize,
        mut k: usize,
        mut a: [i64; n],
    }

    let mut r = 1;
    if k == n {
        let mut m = false;
        for i in 0..k {
            m ^= a[i] < 0;
            r = r * a[i].abs() % M;
        }
        if m {
            r *= -1;
        }
    } else {
        let mut p = Vec::new();
        let mut z = 0;
        let mut m = Vec::new();

        a.sort();
        for i in 0..n {
            if a[i] > 0 {
                p.push(a[i]);
            } else if a[i] == 0 {
                z += 1;
            } else {
                m.push(a[i].abs());
            }
        }

        let plen = p.len();
        let mlen = m.len();
        if k > plen + mlen {
            r = 0;
        } else {
            if plen == 0 {
                if k > mlen {
                    r = 0;
                } else {
                    if k % 2 == 1 {
                        if z > 0 {
                            r = 0;
                        } else {
                            for i in 0..k {
                                r = r * m[mlen - 1 - i] % M;
                            }
                            r = M - r;
                        }
                    } else {
                        for i in 0..k {
                            r = r * a[i] % M;
                        }
                    }
                }
            } else {
                if k % 2 == 1 {
                    r = r * p.pop().unwrap() % M;
                    k -= 1;
                }
                let plen = p.len();
                if plen > 0 {
                    let mut pi = plen;
                    if mlen >= 2 {
                        let mut mi = mlen;
                        while k >= 2 && pi >= 2 && mi >= 2 {
                            if m[mi - 1] * m[mi - 2] > p[pi - 1] * p[pi - 2] {
                                r = r * (m[mi - 1] * m[mi - 2] % M) % M;
                                mi -= 2;
                                k -= 2;
                            } else {
                                r = r * p[pi - 1] % M;
                                pi -= 1;
                                k -= 1;
                            }
                        }
                    }
                    while k > 0 {
                        r = r * p[pi - 1] % M;
                        pi -= 1;
                        k -= 1;
                    }
                } else {
                    for i in 0..k {
                        r = r * m[mlen - 1 - i] % M;
                    }
                }
            }
        }
    }
    println!("{}", r);
}