HDU 1789 Doing Homework again 贪心
来源:互联网 发布:顶级源码 编辑:程序博客网 时间:2024/06/05 08:26
F - Doing Homework again
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
Description
zichen has just come back school from the 30th ACM/ ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If zichen hands in the homework after the deadline, the teacher will reduce his score of the final test. And now we assume that doing everyone homework always takes one day. So zichen wants you to help him to arrange the order of doing homework to minimize the reduced score.
Input
The input contains several test cases. The first line of the input is a single integer T that is the number of test cases. T test cases follow.
Each test case start with a positive integer N(1<=N<=1000) which indicate the number of homework.. Then 2 lines follow. The first line contains N integers that indicate the deadlines of the subjects, and the next line contains N integers that indicate the reduced scores.
Output
For each test case, you should output the smallest total reduced score, one line per test case.
Sample Input
3
3
3 3 3
10 5 1
3
1 3 1
6 2 3
7
1 4 6 4 2 4 3
3 2 1 7 6 5 4
Sample Output
0
3
5
#include<stdio.h>#include<string>#include<cstring>#include<queue>#include<algorithm>#include<functional>#include<vector>#include<iomanip>#include<math.h>#include<iostream>#include<sstream>#include<set>using namespace std;const int MAX=1005;struct work{ int t; int s;};bool cmp(work a,work b){ if (a.s==b.s) return a.t<b.t; return a.s>b.s;}work works[MAX];int T,N;int tsss[10005];int main(){ cin>>T; while(T--) { memset(tsss,0,sizeof(tsss)); int ans=0; int cnt=0; cin>>N; for (int i=0; i<N; i++) cin>>works[i].t; for (int i=0; i<N; i++) cin>>works[i].s; sort(works,works+N,cmp); for (int i=0;i<N;i++) { for (cnt=works[i].t;cnt>0;cnt--) { if(!tsss[cnt]) { tsss[cnt]=1; break; } } if (cnt==0) ans+=works[i].s; } cout<<ans<<endl; }}
- hdu 1789 Doing Homework again 贪心算法
- hdu 1789 Doing Homework again (贪心)
- hdu 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again (贪心)
- hdu 1789 Doing Homework again 贪心算法
- HDU 1789 Doing Homework again(贪心~!)
- HDU 1789 Doing Homework Again( 贪心 )
- hdu 1789 doing homework again 贪心
- 贪心-hdu-1789-Doing Homework again
- hdu 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again 贪心
- HDU 1789 Doing Homework again(贪心)
- hdu 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again(贪心)
- mongoVUE中collections为空,即文件树无法展开问题的解决策略
- poj3176Cow Bowling,数字三角形,动态规划
- hdu 4956 Yet another end of the world ( 取模转化)
- 开启nginx状态监控
- WebView进行post请求
- HDU 1789 Doing Homework again 贪心
- 组合逻辑和时序逻辑
- 关于js原型继承
- 静态方法与非静态方法的区别
- maven 私服搭建(nexus)
- 怎么实现图片的圆角展示还有阴影展示
- HDU 4864 Task 贪心 难题
- RecyclerView 联系人排序
- MySQL学习笔记(五):关于max_allowed_packet错误的问题