55 pts RE求调

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
int dp[205][505]={0};
signed main(){
    int n,w;
    cin>>n>>w;
    memset(dp,0,sizeof dp);
    int v[n+5],p[n+5],minn=0x3f3f3f3f;
    for(int i=1; i<=n; i++){
        cin>>v[i]>>p[i];
        minn=min(minn,v[i]);
    }
    for(int i=1; i<=n; i++){
        v[i]-=minn;
    }
    for(int i=1; i<=n; i++){
        for(int j=i; j>=1; j--){//选了j件物品
            for(int k=300; k>=v[i]; k--){//容量为k
                dp[j][k]=max({dp[j][k],dp[j-1][k-v[i]]+p[i]});
            }
        }
    }
    int maxx=0;
    for(int j=1;j<=n; j++){
        if(w-minn*j<0) break;
        maxx=max(maxx,dp[j][w-minn*j]);
    }
    cout<<maxx;
    return 0;
}
/*
2,5,5,3,2->0,3,3,1,0
*/