HDOJ 1789 Doing Homework again
来源:互联网 发布:缅甸语翻译软件 编辑:程序博客网 时间:2024/06/05 11:29
Doing Homework again
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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.
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
333 3 310 5 131 3 16 2 371 4 6 4 2 4 33 2 1 7 6 5 4
Sample Output
035
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct node{int time;int score;}a[1010];int b[1010];int cmp(node x,node y){return x.score>y.score; }int main(){int t,n;scanf("%d",&t);while(t--){memset(b,0,sizeof(b));scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d",&a[i].time);}for(int i=0;i<n;i++){scanf("%d",&a[i].score);}sort(a,a+n,cmp);int count=0;for(int i=0;i<n;i++){int sign=0;for(int j=a[i].time;j>0;j--)//查找做当前作业可用的时间,若没有则完不成当前作业; { //若a[i].time=4;从1扫到4,若b[1]-b[4]都为1,则作业完不成; if(b[j]==0){b[j]=1;sign=1;break;}}if(!sign) count+=a[i].score;}printf("%d\n",count);}return 0;}
0 0
- HDOJ 1789 Doing Homework again
- hdoj 1789 Doing Homework again
- hdoj 1789 Doing Homework again
- hdoj 1789 Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ-1789 Doing Homework again
- hdoj 1789 Doing Homework again
- hdoj-1789-Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ-1789 Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ 1789 Doing Homework again贪心
- HDOJ 1789 Doing Homework again (贪心)
- hdoj 1789 Doing Homework again 【贪心】
- 真机调试出现错误提示:The certificate used to sign "项目名称" has either expired or has been revoked. An u
- 283. Move Zeroes
- 省市区数据库以及后台工程(Java)前端三级联动 后台数据查询
- Spring事务配置
- mini2440-nandflash基本操作
- HDOJ 1789 Doing Homework again
- java基础方面的笔试题(下)
- 前端开发人员必须了解的七大技能图谱
- SD卡上面的Class代表什么意思
- SiteMesh3使用实例和详解
- hdu 5583 Kingdom of Black and White【枚举】
- Windbg实用手册
- JTextArea添加的内容自动换行
- unity3d network clientrpc cmd