HDOJ1789Doing Homework again(贪心)
来源:互联网 发布:catiav5r22软件下载 编辑:程序博客网 时间:2024/06/02 21:30
Doing Homework again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8899 Accepted Submission(s): 5248
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.
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
//敲代码敲的太快,总是WA,这道题还可以用优先队列做,
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct node{int Dea;int Gra;}s[1010];int per[1010];//用来标记 int cmp(node x,node y){return x.Gra>y.Gra;//对分数进行从大到小进行排列, }int main(){int m,n,i,j,k;scanf ("%d",&n);while (n--){memset(per,0,sizeof(per));scanf ("%d",&m);for (i=0;i<m;i++){scanf ("%d",&s[i].Dea);}for (j=0;j<m;j++){scanf ("%d",&s[j].Gra);}sort(s,s+m,cmp);int Score=0;int p;for (p=0;p<m;p++){int Day=0;for (k=s[p].Dea;k>0;k--){if (per[k]==0)//==0表明这一天没有被占用,还可以完成作业, {Day=1;per[k]=1;break;}}if (Day==0)Score+=s[p].Gra;}printf ("%d\n",Score);}return 0;}
0 0
- HDOJ1789Doing Homework again(贪心)
- hdoj1789Doing Homework again
- hdu1789Doing Homework again(贪心)
- HDU1789Doing Homework again(贪心)
- hdu1789Doing Homework again(贪心)
- Doing Homework again (贪心)
- HDOJ 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(贪心~!)
- Doing Homework again(hdu1789,贪心)
- hdu1789 sdut2076 Doing Homework again(贪心)
- HDU1789--Doing Homework again(贪心)
- GUETOJ - 1118 Doing Homework again(贪心)
- hdu 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again(贪心)
- HDU 4183--Pahom on Water【最大流dinic】
- Ganymed SSH-2 java执行远程linux机器命令工具
- First Missing Positive
- ARM7/9 的中断与 RTOS 系统
- Cocos2dx中添加分享
- HDOJ1789Doing Homework again(贪心)
- Java 算法编程 N阶乘最后总位数问题
- 机器学习实践中应避免的七种常见错误
- 【GDOI 2013模拟】屏保
- mysql 唯一索引
- leetcode_Count and Say
- 位运算
- HDU5363_____Key Set
- dfs Fire Net