40分求调

#include<bits/stdc++.h>
using namespace std;
const int INF=0x3f3f3f3f;
int dp[500050];
int w[10010],v[10010];
int n,m,V;
void solve(){
	memset(dp,0x3f,sizeof(dp));
	int i,j;
	cin>>n>>m>>V;
	for(i=1;i<=n;i++){
		cin>>w[i]>>v[i];
	}
	dp[0]=0; 
	for(i=1;i<=n;i++){
		for(j=m+m;j>=w[i];j--){
			dp[j]=min(dp[j-w[i]]+v[i],dp[j]);
		}
	}
	int minn=INF;
	for(i=m;i<=m+m;i++){
		if(dp[i]<=V){
			minn=min(minn,dp[i]);
		}
	}
	if(minn==INF){
		cout<<-1<<'\n';
	}
	else{
		cout<<minn<<'\n';
	}
	return;
}
int main(){
	int t;
	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}