提交时间:2024-05-20 13:28:35

运行 ID: 147888

# include <bits/stdc++.h> using namespace std ; int osum , nsum , k , mins = 1 << 30 ; struct bot { int o , n , w ; void rd ( ) { cin >> o >> n >> w ; } } ; bot a [1005] ; void dfs ( int cur , int o1 , int n1 , int sum1 ) { if ( cur > k ) { if ( o1 >= osum && n1 >= nsum ) { mins = min ( mins , sum1 ) ; } return ; } dfs ( cur + 1 , o1 + a [cur] . o , n1 + a [cur] . n , sum1 + a [cur] . w ) ; dfs ( cur + 1 , o1 , n1 , sum1 ) ; return ; } int main ( ) { cin >> osum >> nsum >> k ; for ( int i = 1 ; i <= k ; i ++ ) { a [i] . rd ( ) ; } dfs ( 1 , 0 , 0 , 0 ) ; cout << mins << endl ; return 0 ; }