九度 1462：两船载物问题

#include <iostream>
#include <stdio.h>
#include <memory.h>
using namespace std;

int n, c1, c2;
int wet[200];
int dp[10000];

int main() {
    while(scanf("%d%d%d", &n, &c1, &c2) != EOF) {
        int totalWeight = 0;
        bool exceed = false;
        
        int biggerone = max(c1, c2);

        for(int i = 0; i < n; i ++) {
            scanf("%d", wet+i);
            totalWeight += wet[i];
            if(wet[i] > biggerone) {
                exceed = true;
            }
        }

        if(exceed) {
            cout << "NO" << endl;
            continue;
        }

        int c = min(c1, c2);

        memset(dp, 0, sizeof(int)*totalWeight);

        for(int i = 0; i < n; i ++) {
            for(int v = c; v >= wet[i]; v --) {
                dp[v] = max(dp[v], dp[v-wet[i]]+wet[i]);
            }
        }

        int carryone;
        for(int i = 0; i <= c; i ++)
            carryone = max(carryone, dp[i]);
        
        if(biggerone >= totalWeight-carryone)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}