背包。。。不多说。。。上代码。。。。
#include <iostream>
#include <cstdio>
using namespace std;
inline int max( int a, int b ){
return ( a > b ? a : b );
}
int main(){
int N, M;
int w[3402], v[3402];
int dp[12881];
while( scanf( "%d%d", &N, &M ) != EOF ){
for( int i = 0; i < N; i++ ){
cin >> w[i] >> v[i];
}
memset( dp, 0, sizeof( dp ) );
for( int i = 0; i < N; i++ ){
for( int j = M; j >= w[i]; j-- ){
dp[j] = max( dp[j], dp[j-w[i]] + v[i] );
}
}
cout << dp[M] << endl;
}
}