Problem #1052 - ECNU Online Judge
#include<bits/stdc++.h>
using namespace std;
int weight[21],value[21];
int dp[21][100001];
int main(){
int t;
cin>>t;
while(t--){
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>weight[i]>>value[i];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(weight[i]>j) dp[i][j]=dp[i-1][j];
else dp[i][j]=max(dp[i-1][j],dp[i-1][j-weight[i]]+value[i]);
}
}
cout<<dp[n][m]<<endl;;
}
}