Language: C++

 #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <iomanip>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
int dx8[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T*)array, (T*)(array+N), val); }

struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;
const double EPS = 1e-9;

//状態の立て方はok、あとは細部
int main(){
    int N,MA,MB;
    cin >> N >> MA >> MB;
    int dp[51][510][510];//[今まで見た個数][aの合計][bの合計]＝最低金額
    
    vll a(N),b(N),c(N);
    Fill(dp,INF);

    rep(i,N){
        cin >> a[i] >> b[i] >> c[i];
    }

   

    dp[0][0][0] = 0;
    rep(i,N){
        rep(j,510){
            rep(k,510){
                  if(dp[i][j][k] >= INF) continue;
                  chmin(dp[i+1][j+a[i]][k+b[i]],dp[i][j][k] + c[i]);
                  chmin(dp[i+1][j][k],dp[i][j][k]);
            }
        }
    }
    
    int ans=INF;
        rep(j,510){
            rep(k,510){
                //MA:MB = j:kであってほしいのでMA*J == MB*kがほしい 
                if(MA*j != MB*k)continue;
                chmin(ans,dp[N][j][k]);
            }
        }
    if(ans < INF)fin(ans);
    else fin(-1);
}

Compiler output:
a.cc: In function 'int main()':
a.cc:81:24: error: no matching function for call to 'chmin(int&, __gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type)'
   81 |                   chmin(dp[i+1][j+a[i]][k+b[i]],dp[i][j][k] + c[i]);
      |                   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:52:32: note: candidate: 'template<class T> bool chmin(T&, T)'
   52 | template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
      |                                ^~~~~
a.cc:52:32: note:   template argument deduction/substitution failed:
a.cc:81:24: note:   deduced conflicting types for parameter 'T' ('int' and 'long long int')
   81 |                   chmin(dp[i+1][j+a[i]][k+b[i]],dp[i][j][k] + c[i]);
      |                   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~