pub mod chminmax { pub fn chmin(a: &mut T, b: &T) -> bool { if *a > *b { *a = *b; true } else { false } } pub fn chmax(a: &mut T, b: &T) -> bool { if *a < *b { *a = *b; true } else { false } } } pub mod scanner { pub struct Scanner { buf: Vec, } impl Scanner { pub fn new() -> Self { Self { buf: vec![] } } pub fn new_from(source: &str) -> Self { let source = String::from(source); let buf = Self::split(source); Self { buf } } pub fn next(&mut self) -> T { loop { if let Some(x) = self.buf.pop() { return x.parse().ok().expect(""); } let mut source = String::new(); std::io::stdin().read_line(&mut source).expect(""); self.buf = Self::split(source); } } fn split(source: String) -> Vec { source .split_whitespace() .rev() .map(String::from) .collect::>() } } } use crate::{chminmax::chmax, scanner::Scanner}; fn main() { let mut scanner = Scanner::new(); let t: usize = 1; for _ in 0..t { solve(&mut scanner); } } fn solve(scanner: &mut Scanner) { let n: usize = scanner.next(); let x: usize = scanner.next(); let y: usize = scanner.next(); let mut abc = vec![(0, 0, 0); n]; for i in 0..n { let x = scanner.next::(); let y = scanner.next::(); let z = scanner.next::(); abc[i] = (x, y, z); } let mut dp = vec![vec![-1; y + 1]; x + 1]; dp[0][0] = 0; for i in 0..n { let (a, b, c) = abc[i]; for xi in (0..=x).rev() { for yi in (0..=y).rev() { if xi < a || yi < b { continue; } let xj = xi - a; let yj = yi - b; let now = dp[xj][yj] + c; chmax(&mut dp[xi][yi], &now); } } } let mut ans: isize = 0; for xi in 0..=x { for yi in 0..=y { chmax(&mut ans, &dp[xi][yi]); } } println!("{}", ans); }