Submission #16804509


Source Code Expand

Copy
use proconio::input;

fn main() {
    input! {
        _: usize,
        t: usize,
        mut a: [i64; t]
    };
    a.sort();
    let mut l = 0;
    let mut r = t - 1;
    while l < r {
        a[l] -= 1;
        a[r] -= 1;
        if a[l] == 0 {
            l += 1;
        }
        if a[r] == 0 {
            r -= 1;
        }
    }
    let ans = std::cmp::max(0, a[l] - 1);
    println!("{}", ans);
}

Submission Info

Submission Time
Task B - K Cakes
User bouzuya
Language Rust (1.42.0)
Score 200
Code Size 407 Byte
Status AC
Exec Time 8 ms
Memory 2148 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 10
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt
Case Name Status Exec Time Memory
0_000.txt AC 8 ms 2096 KB
0_001.txt AC 1 ms 2108 KB
0_002.txt AC 1 ms 2024 KB
1_003.txt AC 2 ms 2028 KB
1_004.txt AC 2 ms 2068 KB
1_005.txt AC 3 ms 2092 KB
1_006.txt AC 2 ms 2148 KB
1_007.txt AC 2 ms 2020 KB
1_008.txt AC 2 ms 2072 KB
1_009.txt AC 1 ms 2028 KB