HDU-1789-Doing Homework again(贪心)
来源:互联网 发布:图像色彩分析软件 编辑:程序博客网 时间:2024/05/14 17:26
Doing Homework again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 12044 Accepted Submission(s): 7083
Problem Description
Ignatius 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 Ignatius 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 Ignatius 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<iostream>#include<algorithm>#include<string.h>using namespace std;//经典贪心const int maxn=1005;struct node{ int day; int score;} num[maxn];int flag[maxn];bool cmp(node x,node y){ if(x.score==y.score) return x.day>y.day; return x.score>y.score;}int main(){ int T; scanf("%d",&T); while(T--) { int N; scanf("%d",&N); for(int i=1; i<=N; i++) scanf("%d",&num[i].day); for(int i=1; i<=N; i++) scanf("%d",&num[i].score); sort(num+1,num+N+1,cmp); memset(flag,0,sizeof(flag));//初始化所有天都没被占用 int result=0;//失去的最小分数 for(int i=1; i<=N; i++) { int flag_day=num[i].day; while(flag[flag_day]==1) flag_day--; if(flag_day==0)//没找到合适的时间写作业 result+=num[i].score; else flag[flag_day]=1;//找到合适的时间写作业 } printf("%d\n",result); } return 0;}
- 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( 贪心 )
- 最小生成树计数 lydsy 1016
- 获取数据名称、表名、字段名、字段类型
- Android自定义数据库封装之ZzSQLHelper
- Date(日期)对象(复习)
- Python的JSON模块
- HDU-1789-Doing Homework again(贪心)
- 第一次使用博客
- 写给现在
- JS 实现变量在字符串中的多层拼接与嵌套
- Android View 的缓存策略
- 用python简单处理图片(4):图像中的像素访问
- iOS安全攻防-钥匙链安全
- 出现bug时代码审查的重要性
- SQL SERVER一些问题的解决方法