hdu1789Doing Homework again(贪心)
来源:互联网 发布:java md5加密原理 编辑:程序博客网 时间:2024/05/29 10:09
题目链接:
思路:
啊哈哈,点我点我
思路:
这道题是简单的贪心。。先按分数从大到小排序,然后将这个分数的截止日期从后向前扫描,如果碰到没有被标记的则这一天可以做这个作业。。。
题目:
Doing Homework again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6451 Accepted Submission(s): 3838
Problem DescriptionIgnatius 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.
InputThe 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.
OutputFor each test case, you should output the smallest total reduced score, one line per test case.
Sample Input333 3 310 5 131 3 16 2 371 4 6 4 2 4 33 2 1 7 6 5 4
Sample Output035
Authorlcy
Source2007省赛集训队练习赛(10)_以此感谢DOOMIII
Recommendlcy
代码为:
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.
333 3 310 5 131 3 16 2 371 4 6 4 2 4 33 2 1 7 6 5 4
035
#include<cstdio>#include<map>#include<iostream>#include<algorithm>using namespace std;map<int,bool>mp;struct homework{ int deadline,score;}home[1000+10];bool cmp(homework a,homework b){ if(a.score==b.score) return a.deadline<b.deadline; else return a.score>b.score;}int main(){ int n,ans,l,t; scanf("%d",&t); while(t--) { scanf("%d",&n); ans=0; for(int i=1;i<=n;i++) { scanf("%d",&home[i].deadline); mp[i]=false; } for(int i=1;i<=n;i++) scanf("%d",&home[i].score); sort(home+1,home+1+n,cmp); for(int i=1;i<=n;i++) { for(l=home[i].deadline;l>=1;l--) { if(!mp[l]) { mp[l]=true; break; } } if(l<1) ans=ans+home[i].score; } printf("%d\n",ans); } return 0;}
0 0
- hdu1789Doing Homework again(贪心)
- HDU1789Doing Homework again(贪心)
- hdu1789Doing Homework again(贪心)
- hdu1789doing homework again【贪心】
- HDU1789Doing Homework again(贪心+sort)
- hdu1789Doing Homework again【贪心算法】
- HDU1789Doing Homework again
- hdu1789Doing Homework again
- HDU1789Doing Homework again
- HDOJ1789Doing 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,贪心)
- 【HDU】3996 Gold Mine 最大权闭合子图
- JNI的一些使用
- poj 3628 Bookshelf 2(01背包)
- 【学生管理系统】总结篇
- 杭电 2124 Repair the Wall
- hdu1789Doing Homework again(贪心)
- HDU1114_Piggy-Bank(背包/完全背包)
- Apache+PHP5+MySQL配置总结
- Codeforces Round #252 D 置换群的简单应用
- IIS中“启用内容过期”研究
- Android 开发笔记第二季 DialogFragment
- LA3027 带权并查集
- 2014-08-01 日志
- hdu2041 超级楼梯