HDU 1789 Doing Homework again
2016-01-16 14:26
399 查看
Doing Homework again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9936 Accepted Submission(s): 5803
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, you should output the smallest total reduced score, one line per test case.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
0 3 5
先对分数进行排序,如果分数一样,就按日期从小到大排,如果同一天有不同的分数,那么就往前找,被挤出来的就是要被加进去的罚分
#include<iostream> #include<stdio.h> #include<string.h> #include<algorithm> using namespace std; const int MAXN=1010; struct Node { int d,s; }node[MAXN]; int vis[10000]; bool cmp(Node a,Node b) { if(a.s==b.s) { return a.d<b.d; } return a.s>b.s; } int main() { int T; int n; int j; scanf("%d",&T); while(T--) { scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&node[i].d); for(int i=0;i<n;i++) scanf("%d",&node[i].s); sort(node,node+n,cmp); memset(vis,0,sizeof(vis)); int ans=0; for(int i=0;i<n;i++) { for(j=node[i].d;j>0;j--) //排完序后,从截止日期往前找,找到没被占用的空间然后进行替代,最后被挤下来的就是最小的 { if(!vis[j]) { vis[j]=1; break; } } if(j==0) ans+=node[i].s; } printf("%d\n",ans); } return 0; }
相关文章推荐
- 服务器TIME_WAIT和CLOSE_WAIT详解和解决办法
- hdu2057 A + B Again
- [ILINK32 Error] Error: Unresolved external 'WSAIoctl'
- POJ 2027 No Brainer
- NSBundle 的理解和 mainBundle 类方法的详解
- set集合中的contains操作
- G面经prepare: X-Straight
- System.Net.Mail发送邮件
- Failed to execute goal on project ecz-wx: Could not resolve dependencies for project
- 【数组】Container With Most Water
- Codeforces Gym 100231F Solitaire 折半搜索
- Syntax error, annotations are only available if source level is 1.5
- vector pair sort
- 2.7 过程表示
- 2.5 框架表示
- Daily Scrum – 1/15
- [POJ 2010]Moo University - Financial Aid[优先队列]
- AIX 6.1 新建fs出错
- 对意识的思考--我--机器人--程序--人工智能
- hive drop table报错:FAILED: SemanticException MetaException(message:Timeout when executing method: g