提出 #58970061

---

ソースコード 拡げる

use std::collections::{BTreeMap, BinaryHeap};
use itertools::Itertools;
use proconio::input;
use proconio::marker::Usize1;

fn main() {
    input! { t : usize }
    for _ in 0..t { solve(); }
}

fn solve() {
    input! {
        n : usize,
        k : usize,
        a : [usize; n],
        b : [usize; n]
    }
    
    let mut mp = BTreeMap::new();
    for i in 0..n {
        mp.entry(a[i]).or_insert(vec![]).push(b[i]);
    }
    
    let mut ans = usize::MAX;
    let mut amax = 0;
    
    let mut pq1 = BinaryHeap::new();
    let mut sum = 0;
    
    for (key, v) in mp {
        amax = amax.max(key);
        for v in v {
            if pq1.len() < k { sum += v; pq1.push(v); }
            else {
                if *pq1.peek().unwrap() > v {
                    sum -= pq1.pop().unwrap();
                    sum += v;
                    pq1.push(v);
                }
            }
        }
        if pq1.len()>=k { ans = ans.min(amax * sum); }
    }
    
    println!("{}", ans);
}

提出情報

コンパイルエラー

warning: unused import: `itertools::Itertools`
 --> src/main.rs:2:5
  |
2 | use itertools::Itertools;
  |     ^^^^^^^^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused import: `proconio::marker::Usize1`
 --> src/main.rs:4:5
  |
4 | use proconio::marker::Usize1;
  |     ^^^^^^^^^^^^^^^^^^^^^^^^

ジャッジ結果