swjtuoj 2380 Knapsack Problem

题目链接：Knapsack Problem

题目大意：给你一个W和V然后一堆w[i]和v[i]，叫你去算是不是sigma(w[i]) < W&&sigma(v[i]) < V

题目思路：就随手做一下就好了，因为是校赛题，还是补一下题解

#include <bits/stdc++.h>

using namespace std;

int n,W,D,w,d,sum1,sum2;

void solve() {
    scanf("%d%d%d",&n,&W,&D);
    for(int i = 0;i < n;i++)
        scanf("%d",&w),sum1 += w;
    for(int i = 0;i < n;i++)
        scanf("%d",&d),sum2 += d;
    if(sum1 <= W&&sum2 <= D)
        puts("YES");
    else puts("NO");
}

int main(){
    int t = 1;
    cin >> t;
    while (t--) {
        sum1 = 0,sum2 = 0;
        solve();
    }
    return 0;
}