HDU
来源:互联网 发布:北京华贸广场caffe 编辑:程序博客网 时间:2024/06/05 04:06
Doing Homework again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14230 Accepted Submission(s): 8269
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
题意:
老师布置了n道家庭作业,每个作业有截至日期和分数,如果到截止日期还没有完成,就要扣掉相应的分数。每个作业耗时1天。
题解:
直接枚举天数。按照贪心思想,先将作业排序,优先将分数从大到小排序,如果分数相同则将deadline从小到大排序(多余的一逼)。两层循环,第一层枚举作业,第二层从当前作业的deadline往前枚举天数,如果这一天没有安排(即没被标记),就可以将这个作业安排在这一天,如果前面几天都有安排,则将score加到sum里。代码如下:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct node{ int deadline,score;}p[1005];bool vis[2000];bool cmp(node a,node b){ return a.score==b.score? a.deadline<b.deadline:a.score>b.score;}int main(){ int t,n; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&p[i].deadline); for(int i=0;i<n;i++) scanf("%d",&p[i].score); sort(p,p+n,cmp); memset(vis,0,sizeof(vis)); int res=0,flag; for(int i=0;i<n;i++) { flag=0; for(int j=p[i].deadline;j>0;j--) { if(!vis[j]) { vis[j]=1; flag=1; break; } } if(!flag) res+=p[i].score; } printf("%d\n",res); } return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- 如何理解并正确使用MySql索引
- java 反射
- HTTPie 工具使用入门
- 什么时候析构函数需要定义为虚函数
- 链路聚合
- HDU
- 代理模式--原理及实现
- cpu如何知道内存中一条指令的大小从而使cs:ip寄存器更改自己的值
- linux sed命令详解
- 机器视觉——旋转矩阵的计算(二)
- sklearn的precision_score, recall_score, f1_score使用
- WordPress 自定义链接
- 暴力(Cake,HDU 5355)
- DOM中的一些概念