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)

use std::collections::*;
use std::io::*;
use std::*;
macro_rules! get {
        ($($t:tt),*; $n:expr) => {
            {
                let stdin = std::io::stdin();
                let ret = std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
                    let line = line.unwrap();
                    let mut it = line.split_whitespace();
                    _get!(it; $($t),*)
                }).collect::<Vec<_>>();
                ret
            }
        };
        ($($t:tt),*) => {
            {
                let mut line = String::new();
                std::io::stdin().read_line(&mut line).unwrap();
                let mut it = line.split_whitespace();
                _get!(it; $($t),*)
            }
        };
    }
macro_rules! _get {
        // iterator(splitted input-string) => iterator(output-type)
        ($it:ident; [char]) => {
            _get!($it; String).chars().collect::<Vec<_>>()
        };
        ($it:ident; usize1) => {
            $it.next().unwrap().parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
        };
        ($it:ident; [usize1]) => {
            $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
        };
        ($it:ident; [$t:ty]) => {
            $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
        };
        ($it:ident; $t:ty) => {
            $it.next().unwrap().parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
        };
        ($it:ident; $($t:ty),+) => {
            ($(_get!($it; $t)),*)
        };
    }
mod modint {
    use std::ops::*;
    pub trait Mod: Copy {
        fn m() -> u64;
    }
    #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
    pub struct Modint<M> {
        x: u64,
        phantom: std::marker::PhantomData<M>,
    }
    impl<M: Mod> Modint<M> {
        pub fn new(x: i64) -> Self {
            Modint::new_internal(((x % (M::m() as i64) + M::m() as i64) % M::m() as i64) as u64)
        }
        fn new_internal(x: u64) -> Self {
            Modint {
                x,
                phantom: std::marker::PhantomData,
            }
        }
        pub fn pow(self, mut e: u64) -> Self {
            let mut res = Modint::new_internal(1);
            let mut acc = self;
            while e > 0 {
                if e % 2 != 0 {
                    res *= acc;
                }
                acc *= acc;
                e /= 2;
            }
            res
        }
        pub fn inv(self) -> Self {
            self.pow(M::m() - 2)
        }
    }
    impl<M: Mod, T: Into<Modint<M>>> Add<T> for Modint<M> {
        type Output = Self;
        fn add(self, other: T) -> Self {
            let mut sum = self.x + other.into().x;
            if sum >= M::m() {
                sum -= M::m();
            }
            Modint::new_internal(sum)
        }
    }
    impl<M: Mod, T: Into<Modint<M>>> Sub<T> for Modint<M> {
        type Output = Self;
        fn sub(self, other: T) -> Self {
            let mut diff = self.x as i64 - other.into().x as i64;
            if diff < 0 {
                diff += M::m() as i64;
            }
            Modint::new_internal(diff as u64)
        }
    }
    impl<M: Mod, T: Into<Modint<M>>> Mul<T> for Modint<M> {
        type Output = Self;
        fn mul(self, other: T) -> Self {
            Modint::new((self.x * other.into().x) as i64)
        }
    }
    impl<M: Mod, T: Into<Modint<M>>> AddAssign<T> for Modint<M> {
        fn add_assign(&mut self, other: T) {
            *self = *self + other;
        }
    }
    impl<M: Mod, T: Into<Modint<M>>> SubAssign<T> for Modint<M> {
        fn sub_assign(&mut self, other: T) {
            *self = *self - other;
        }
    }
    impl<M: Mod, T: Into<Modint<M>>> MulAssign<T> for Modint<M> {
        fn mul_assign(&mut self, other: T) {
            *self = *self * other;
        }
    }
    impl<M> std::fmt::Display for Modint<M> {
        fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
            self.x.fmt(f)
        }
    }
    impl<M: Mod> From<i64> for Modint<M> {
        fn from(x: i64) -> Self {
            Self::new(x)
        }
    }
    impl<M: Mod> From<i32> for Modint<M> {
        fn from(x: i32) -> Self {
            Self::new(x as i64)
        }
    }
    impl<M: Mod> From<usize> for Modint<M> {
        fn from(x: usize) -> Self {
            Self::new(x as i64)
        }
    }
}
macro_rules! define_mod {
    ($ struct_name : ident , $ modulo : expr ) => {
        #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
        struct $struct_name {}
        impl modint::Mod for $struct_name {
            #[inline]
            fn m() -> u64 {
                $modulo
            }
        }
    };
}
define_mod!(P, 1_000_000_007);
type Modint = modint::Modint<P>;

fn main() {
    let (n, k) = get!(i32, i32);
    let mut a = get!([i64]);
    let mut allpos: bool = true;
    let mut allneg: bool = true;
    for i in &a {
        if i < &0 {
            allpos = false;
        } else if i >= &0 {
            allneg = false;
        }
    }
    a.sort_by(|a, b| {
        let na = a.abs();
        let nb = b.abs();
        na.cmp(&nb).reverse()
    });
    let mut ans = Modint::new(1);
    if allpos {
        for i in 0..k {
            ans *= a[i as usize];
        }
    } else if allneg {
        if k % 2 == 0 {
            for i in 0..k {
                ans *= a[i as usize];
            }
        } else {
            for i in (n - k..n).rev() {
                ans *= a[i as usize];
            }
        }
    } else {
        if n == k {
            for i in a {
                ans *= i;
            }
        } else {
            let mut negs: Vec<i64> = Vec::new();
            let mut poss: Vec<i64> = Vec::new();
            for i in a {
                if i >= 0 {
                    poss.push(i);
                } else {
                    negs.push(i);
                }
            }
            let mut negpos = (n / 2 * 2).min(negs.len() as i32 / 2 * 2);
            let mut pospos = k - negpos;
            for i in 0..negpos {
                ans *= negs[i as usize];
            }
            for i in 0..pospos {
                ans *= poss[i as usize];
            }

            for _ in 0..negpos / 2 {
                if poss.len() as i32 <= pospos + 2 {
                    break;
                }
                let ne = negs[(negpos - 1) as usize] * negs[(negpos - 2) as usize];
                let po = poss[pospos as usize] * poss[(pospos + 1) as usize];
                if ne > po {
                    break;
                }
                ans *= Modint::from(ne).inv();
                ans *= po;
                pospos += 2;
                negpos -= 2;
            }
        }
    }
    println!("{}", ans);
}