hdu 1789
来源:互联网 发布:游戏脚本软件 编辑:程序博客网 时间:2024/06/05 23:40
Doing Homework again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6879 Accepted Submission(s): 4097
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
Author
lcy
#include <cstdio>#include <cstring>#include <algorithm>#include <cstdlib>using namespace std;struct Node{int dt,sc;};Node node[1005];int vis[1005];int cmp(const void *a,const void *b){Node *c=(Node *)a;Node *d=(Node *)b;if(c->sc!=d->sc)return d->sc-c->sc;elsereturn c->dt-d->dt; } int main(){int t,n,i,j;int sum;scanf("%d",&t);while(t--){scanf("%d",&n);for(i=0;i<n;i++){scanf("%d",&node[i].dt);} for(i=0;i<n;i++){scanf("%d",&node[i].sc);}//sort(node,node+n,cmp) ;qsort(node,n,sizeof(node[0]),cmp);memset(vis,0,sizeof(vis)); //for(i=0;i<n;i++)//printf("%d %d\n",node[i].dt,node[i].sc);int sumt=0; for(i=0;i<n;i++) { int time=node[i].dt; for(time;time>0;time--) <span style="font-family: Arial, Helvetica, sans-serif;">//注意处理</span> { if(!vis[time]) { vis[time]=1; break; } } if(time==0) sumt+=node[i].sc;}printf("%d\n",sumt);} return 0;}
0 0
- HDU 1789
- hdu 1789
- HDU 1789
- hdu 1789
- hdu-1789
- Hdu 1789
- hdu 1789
- hdu 1789
- HDU-1789
- HDU 1789
- HDU-1789
- HDU 1789
- HDU-1789
- HDU 1789
- hdu 1050+hdu 1789+hdu 3177(贪心)
- HDU ACM 1789
- hdu 1789 贪心
- hdu 1789 贪心算法
- GLView基本分析
- android快速开发框架
- XUtils
- 算法的时间复杂度和空间复杂度-总结
- 关于static静态的、继承、接口interface、final关键字、单例设计模式总结
- hdu 1789
- Spring InitializingBean
- 1.宽字节字符集(unicode)和多字节字符集
- Spring3事务管理——使用@Transactional 注解
- 使用diskpart修复EFI分区变主分区的问题
- Filter过滤器
- expdp异地备份
- Ubuntu系统deb包的安装方法
- js中对json格式的数据的增删改查