HDU 1789 Doing Homework again
来源:互联网 发布:背单词的app 知乎 编辑:程序博客网 时间:2024/05/21 22:24
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
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
先对分数进行排序,如果分数一样,就按日期从小到大排,如果同一天有不同的分数,那么就往前找,被挤出来的就是要被加进去的罚分
#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;}
0 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
- 修改tomcat项目的图标
- 关于多线程执行显示进度条的实例!
- JVM关闭及线程的退出
- Eclipse Classic、Eclipse Standard和Eclipse IDE for Java Developers 的联系与区别
- DiscuzX3.2和UC 密码丢失的解决方法
- HDU 1789 Doing Homework again
- 查询联系人姓名和电话
- Zookeeper中主从模式结构场景练习
- Git-生成SSH公钥
- Poj2417 大步小步算法
- compass出错
- java复习路线一
- 如何能做到搜索一个文件夹里所有文档是否含有某个字符
- 关于在windows下SFTP服务器的建立