luogu1509:找啊找啊找GF

#include<bits/stdc++.h>
using namespace std;

struct A{int mon,rp,time;}a[110];
struct DP{int t,num;}dp[110][110];
int main()
{
	int n,m,r,lt=999999999,ans;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d %d %d",&a[i].mon ,&a[i].rp ,&a[i].time );
	scanf("%d %d",&m,&r);
	for(int i=1;i<=n;i++)
	{
		for(int j=m;j>=a[i].mon ;j--)
		{
			for(int k=r;k>=a[i].rp ;k--)
			{
				if(dp[j][k].num <dp[j-a[i].mon ][k-a[i].rp ].num +1)
				{
					dp[j][k].num =dp[j-a[i].mon ][k-a[i].rp ].num +1;
					dp[j][k].t =dp[j-a[i].mon ][k-a[i].rp ].t +a[i].time ;
				}
				else if(dp[j][k].num ==dp[j-a[i].mon ][k-a[i].rp ].num +1)
				{
					dp[j][k].t =min(dp[j][k].t ,dp[j-a[i].mon ][k-a[i].rp ].t +a[i].time );
				}
			}
		}
	}
	printf("%d",dp[m][r].t);
	return 0;
}