Crixalis's Equipment
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2893 Accepted Submission(s): 1185
like living underground and digging holes.
Someday Crixalis decides to move to another nice place and build a new house for himself (Actually it's just a new hole). As he collected a lot of equipment, he needs to dig a hole beside his new house to store them. This hole has a volume of V units, and Crixalis
has N equipment, each of them needs Ai units of space. When dragging his equipment into the hole, Crixalis finds that he needs more space to ensure everything is placed well. Actually, the ith equipment needs Bi units of space during the moving. More precisely
Crixalis can not move equipment into the hole unless there are Bi units of space left. After it moved in, the volume of the hole will decrease by Ai. Crixalis wonders if he can move all his equipment into the new hole and he turns to you for help.
N lines contain N pairs of integers: Ai and Bi.
0<T<= 10, 0<V<10000, 0<N<1000, 0 <Ai< V, Ai <= Bi < 1000.
2 20 3 10 20 3 10 1 7 10 2 1 10 2 11
Yes No
贪心,按照预留体积和实际所需体积之间的差值从大到小排序,可以这么想,差值大的,它对体积要求大,那么肯定要放在前面去处理
#include<map> #include<set> #include<list> #include<stack> #include<queue> #include<vector> #include<cmath> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; struct node { int A, B; }equ[1010]; int cmp(node a, node b) { return a.B -a.A > b.B - b.A; } int main() { int t; int n; int v; scanf("%d", &t); while(t--) { scanf("%d%d", &v, &n); for(int i = 0; i < n; i++) { scanf("%d%d", &equ[i].A, &equ[i].B); } sort(equ, equ + n, cmp); bool flag = true; for(int i = 0; i < n; i++) { if(equ[i].B <= v) { v -= equ[i].A; } else { flag = false; break; } } if(flag) printf("Yes\n"); else printf("No\n"); } return 0; }