求调

//998244353
#include<bits/stdc++.h>
#define itn int
#define int long long
using namespace std;
const int N=50010;
int dp[N],p[N],c[N],n,m,output=0x3f3f3f;
signed main()
{
	memset(dp,0x3f3f3f,sizeof(dp));
	dp[0]=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>p[i]>>c[i];
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<=N;j++)
		{
			if(j>=p[i])
			{
				dp[j]=min(dp[j],dp[j-p[i]]+c[i]);
			}
		}
	}
	for(int i=m;i<=N;i++)
	{
		output=min(output,dp[i]);
	}
	cout<<output;
}

//998244353
#include<bits/stdc++.h>
#define itn int
#define int long long
using namespace std;
const int N=60010;
int dp[N],p[N],c[N],n,h,output=0x3f3f3f3f;
signed main()
{
	for(int i=1;i<=N;i++)
	{
		dp[i]=0x3f3f3f3f;
	}
	cin>>n>>h;
	for(int i=1;i<=n;i++)
	{
		cin>>p[i]>>c[i];
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=60000;j++)
		{
			if(j>=p[i])
			{
				dp[j]=min(dp[j],dp[j-p[i]]+c[i]);
			}
		}
	}
	for(int i=h;i<=60000;i++)
	{
		output=min(output,dp[i]);
	}
	cout<<output;
}