XidianOJ 1146 万神的竞赛

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm> 
using namespace std;

int f[100000]; 
int n;
int w;
int cost[1001],value[1001];
int main(){
    
    while (scanf("%d %d",&n,&w) != EOF){

        int i,j;
        int maxValue = 0;
        for (i=1;i<=n;i++){
            scanf("%d %d",&cost[i],&value[i]);
            maxValue += value[i];
        }
        for (i=1;i<=maxValue;i++){
            f[i] = w+1;
        }
        f[0] = 0;
        int maxj = 0; 
        for (i=1;i<=n;i++){
            for (j=maxValue;j>=value[i];j--){
                f[j] = min(f[j],f[j-value[i]]+cost[i]);
            }
        }

        int maxi = 1;
        for (i=1;i<=maxValue;i++){
            if (f[i] > w) continue; 
            maxi = i;
        }
        printf("%d\n",maxi);
    }
    return 0;
}