swjtuoj 2380 Knapsack Problem
来源:互联网 发布:linux同名文件夹 编辑:程序博客网 时间:2024/06/05 20:38
题目链接: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;}
阅读全文
0 0
- swjtuoj 2380 Knapsack Problem
- swjtuoj 2383 Music Problem
- Knapsack problem poj 3264
- The Knapsack problem
- 背包问题(Knapsack problem)
- FZU 2214 Knapsack problem
- FOJ-2214 Knapsack problem
- Knapsack problem(FZU2214)
- Knapsack Problem|背包问题
- Knapsack problem I
- FZU - 2214-Knapsack problem
- 0-1 knapsack problem
- The Knapsack problem Gym
- 0-1 Knapsack Problem
- Knapsack Problem(完全背包)
- FOJ Problem 2214 Knapsack problem
- SWJTUOJ-2366 A chess Problem (easy)
- SWJTUOJ-2364 A room Problem(easy)
- DNS服务器1
- linux socket编程之多路复用select的例子
- MMU
- [Leetcode]_27 Remove Element
- 剑指offer
- swjtuoj 2380 Knapsack Problem
- Unity3D 学习笔记 —— Tween对象的实现与动作管理
- android 的单例模式
- c++第六次实验-数组的合并
- Unknown host 'android.oa.com'. You may need to adjust the proxy settings in Gradle.
- 用java编写一个计算器
- python基础知识
- Mysql锁机制
- linux shell函数使用