#492581 (Rust) No.1071 ベホマラー

• 問題: No.1071 ベホマラー
• ユーザー: ziita
• 提出日時: 2020-06-05 21:42:25
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 21 ms / 2,000 ms
• コード長: 3,132 bytes
• コンパイル時間: 13,418 ms
• コンパイル使用メモリ: 401,128 KB
• 実行使用メモリ: 6,188 KB
• 最終ジャッジ日時: 2024-05-09 20:31:31
• 合計ジャッジ時間: 12,617 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	0 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	0 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	19 ms; 5,376 KB
testcase_11	AC	17 ms; 5,376 KB
testcase_12	AC	11 ms; 5,376 KB
testcase_13	AC	14 ms; 5,376 KB
testcase_14	AC	19 ms; 5,376 KB
testcase_15	AC	21 ms; 5,548 KB
testcase_16	AC	21 ms; 5,668 KB
testcase_17	AC	21 ms; 5,676 KB
testcase_18	AC	21 ms; 5,800 KB
testcase_19	AC	21 ms; 5,484 KB
testcase_20	AC	18 ms; 6,188 KB
testcase_21	AC	17 ms; 6,180 KB
testcase_22	AC	16 ms; 6,188 KB
testcase_23	AC	15 ms; 6,056 KB
testcase_24	AC	20 ms; 5,672 KB

ソースコード

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254

macro_rules! eprint {
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = write!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! eprintln {
	() => { eprintln!(""); };
	($($t:tt)*) => {{
		use ::std::io::Write;
		let _ = writeln!(::std::io::stderr(), $($t)*);
	}};
}
macro_rules! dbg {
	($v:expr) => {{
		let val = $v;
		eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
		val
	}}
}

macro_rules! mat {
	($($e:expr),*) => { Vec::from(vec![$($e),*]) };
	($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
	($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
	($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
	($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
		$a$([$i])*.$f($($t),*)
	};
	($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
		let t = $e;
		ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
	} };
}

pub fn readln() -> String {
	let mut line = String::new();
	::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
	line
}

macro_rules! read {
	($($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();
			_read!(it; $($t),*)
		}).collect::<Vec<_>>();
		ret
	}};
	($($t:tt),*) => {{
		let line = readln();
		let mut it = line.split_whitespace();
		_read!(it; $($t),*)
	}};
}

macro_rules! _read {
	($it:ident; [char]) => {
		_read!($it; String).chars().collect::<Vec<_>>()
	};
	($it:ident; [u8]) => {
		Vec::from(_read!($it; String).into_bytes())
	};
	($it:ident; usize1) => {
		$it.next().unwrap_or_else(|| panic!("input mismatch")).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_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
	};
	($it:ident; $($t:tt),+) => {
		($(_read!($it; $t)),*)
	};
}


pub fn main() {
	let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: i64 = 1_000_000_007;
const INF: i64 = std::i64::MAX/3;

fn solve() {
	let (n,k,x,y) = read!(usize,i128,i128,i128);
	let a = read!([i128]);
	let mut q = BinaryHeap::new();
	for i in a {
		q.push(Reverse(i-1));
	}
	let mut ans = 0;
	let mut num = n as i128;
	let mut sum = 0;
	while let Some(Reverse(val)) = q.pop() {
		let tmp = val - sum;
		if tmp<=0 {
			num -= 1;
			continue;
		}
		let times = (tmp+k-1)/k;
		let mi = min(y*times, x*num*times);
		ans += mi;
		sum += k*times;
		num -= 1;
		// println!("{} {}",mi,ans);
	}
	println!("{}", ans);
}

fn run() {
    solve();
}