fn main() { input! { n: usize, m: usize, w: i32, a: [i32; n], b: [i32; n], c: [i32; m], d: [i32; m], } let mut dp = vec![false; 1 << (n + m)]; dp[0] = true; let mut ans = 0; for i in 0..(1 << (n + m)) { let v = dp[i]; if !v { continue; } let mut sum = 0; let mut val = 0; for j in 0..(n + m) { let (a, b) = if j < n { (a[j], b[j]) } else { (-c[j - n], -d[j - n]) }; if i >> j & 1 == 1 { sum += a; val += b; } } ans = ans.max(val); for j in 0..(n + m) { let (a, b) = if j < n { (a[j], b[j]) } else { (-c[j - n], -d[j - n]) }; if i >> j & 1 == 0 && 0 <= sum + a && sum + a <= w { dp[i | (1 << j)] = true; } } } println!("{}", ans); } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- // ---------- begin chmin, chmax ---------- pub trait ChangeMinMax { fn chmin(&mut self, x: Self) -> bool; fn chmax(&mut self, x: Self) -> bool; } impl ChangeMinMax for T { fn chmin(&mut self, x: Self) -> bool { *self > x && { *self = x; true } } fn chmax(&mut self, x: Self) -> bool { *self < x && { *self = x; true } } } // ---------- end chmin, chmax ----------