BNUOJ 44583 Star Trek: First Contact

题意：自身有总能量a，敌方血量为b，有n枚导弹，发射时分别会消耗自身vi的能量，对对方造成wi的伤害，判断是否能用这些弹药摧毁敌舰

链接：http://www.bnuoj.com/v3/problem_show.php?pid=44583

思路：妥妥的裸背包问题，模板随便一搞就行

注意点：

以下为AC代码：

Username	RunID	ID	Result	Language	Time	Memory	Length	Submit Time
luminous11	435469	F	Accepted	GNU C++	4 ms	1892 KB	1389 B	2014-12-26 20:09:20

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;

int w[105];
int v[105];
int dp[10005];

int main()
{
    ios::sync_with_stdio( false );
    int t;
    cin >> t;
    for ( int ncase = 1; ncase <= t; ncase ++ )
    {
        clr ( w, 0 );
        clr ( v, 0 );
        clr ( dp, 0 );
        int a, b, n;
        cin >> a >> b >> n;
        for ( int i = 0; i < n; i ++ )
        {
            cin >> v[i];
        }
        for ( int i = 0; i < n; i ++ )
        {
            cin >> w[i];
        }
        for ( int i = 0; i < n; i ++ )
        {
            for ( int j = a; j >= v[i]; j -- )
            {
                dp[j] = max ( dp[j], dp[j-v[i]] + w[i] );
            }
        }
        cout << "Case #"<< ncase <<": ";
        if ( dp[a] >= b )cout << "YES" << endl;
        else cout << "NO" << endl;
    }
    return 0;
}