HDU 1789 Doing Homework again
来源:互联网 发布:华夏风云武将数据 编辑:程序博客网 时间:2024/06/11 22:45
A - Doing Homework again
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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 <algorithm>#include <string.h>#define N 1005using namespace std;typedef struct{ int score,day;}item;item a[N];int temp[N];bool cmp(item a,item b){ return a.score>b.score;}int main(){ int T; cin>>T; while(T--) { memset(temp,0,sizeof(temp)); int n,sum=0; cin>>n; for(int i=0;i<n;i++) cin>>a[i].day; for(int i=0;i<n;i++) cin>>a[i].score; sort(a,a+n,cmp); int k; for(int i=0;i<n;i++) { k=a[i].day; while(temp[k]&&k>=1) k--; if(k<1) sum+=a[i].score; else temp[k]=1; } cout<<sum<<endl; } 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
- WCF基础教程(二)——解析iis8和iis8.5+VS2013发布wcf服务问题
- [leetcode 234]Implement Queue using Stacks
- python正则表达式 re (二)compile
- 大数据.......
- mysql存储引擎InnoDB插入数据的过程详解
- HDU 1789 Doing Homework again
- Spark 性能相关参数配置详解-shuffle篇
- 如何new一个二维数组
- poj 1564 Sum It Up 搜索
- POJ3641(Pseudoprime numbers 费马小定理)
- 界面之间传值
- jQuery 的 ready 函数是如何工作的?
- 12. 打印1到最大的n位数
- WeChatServer