poj3040

reference :
http://blog.csdn.net/sdj222555/article/details/10279225

#include <iostream>
#include <string.h>
#define INF 1000000000
using namespace std;

int N,C;
int V[32],B[32];
int sum = 0;
int use[32];

int main(int argc, const char * argv[]) {
    cin>>N>>C;
    for(int i=0;i<N;i++){
        cin>>V[i]>>B[i];
        if(V[i]>=C){
            sum += B[i];
            B[i] = 0;
        }
    }

    for(int i=0;i<N;i++){
        for(int j=i+1;j<N;j++){
            if(V[j]<V[i]){
                int tmp;

                tmp = V[i];
                V[i] = V[j];
                V[j] = tmp;

                tmp = B[i];
                B[i] = B[j];
                B[j] = tmp;
            }
        }
    }

    /*for(int i=0;i<N;i++){
        cout<<V[i]<<' '<<B[i]<<endl;
    }*/

    while(true){
        //cout<<sum<<endl;
        bool flag = false;
        int rest = C;

        memset(use,0,sizeof(use));
        for(int i=N-1;i>=0;i--){
            int tmp = min(B[i],rest / V[i]);
            rest -= tmp * V[i];
            use[i] = tmp;
            if(rest<=0){
                flag = 1;
                break;
            }
        }

        if(rest>0){
            for(int i=0;i<N;i++){
                if(B[i]>use[i]){
                    while(use[i]<=B[i]){
                        rest -= V[i];
                        use[i]++;
                        if(rest<=0){
                            flag = 1;
                            break;
                        }
                    }
                }
                if(rest<=0){
                    break;
                }
            }
        }

        /*for(int i=0;i<N;i++){
            cout<<use[i]<<' ';
        }
        cout<<endl;*/

        if(!flag)break;

        int minx = INF;
        for(int i = N-1;i>=0;i--){
            if(use[i])minx = min(minx,B[i]/use[i]);
        }

        sum += minx;

        for(int i=N-1;i>=0;i--){
            B[i] -= minx * use[i];
        }
    }
    cout<<sum<<endl;
    return 0;
}