# HDU 1789 Doing Homework again

Quetions:
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.
Output
For each test case, you should output the smallest total reduced score, one line per test case.
Sample Input
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
Sample Output
0
3
5

(http://acm.hust.edu.cn/vjudge/contest/125402#problem/G)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
LL ans;
int f[10005];
struct node
{
int day,score;
}a[1005];
bool cmp(node x,node y)
{
if(x.score==y.score)
return x.day<y.day;
else return x.score>y.score;  // 分数第一考虑，其次截止日期
}
int main()
{
int T,n;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
memset(f,0,sizeof(f));
ans=0;
for(int i=1;i<=n;i++)
scanf("%d",&a[i].day);
for(int i=1;i<=n;i++)
scanf("%d",&a[i].score);
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++)
{
int flag=0;
if(!f[a[i].day])
f[a[i].day]=1;   //先找其对应位置
else
{
for(int j=a[i].day;j>=1;j--)  //其对应位置被占据，则依次往前看有哪一个没有被占据，并占据
{
if(!f[j])
{
flag=1;
f[j]=1;
break;
}
}
if(!flag)
ans+=a[i].score;
}
}
cout<<ans<<endl;
}
}


• 本文已收录于以下专栏：

## HDU - 1789 Doing Homework again

Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homewo...
• u011345136
• 2014年07月28日 11:35
• 665

## HDU_1789_DoingHomeworkAgain

Doing Homework again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Ot...
• baidu_29410909
• 2015年07月29日 23:25
• 337

## HDU1789：Doing Homework again

Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of ...
• libin56842
• 2013年03月14日 20:47
• 2529

## HDU1789:Doing Homework again 【贪心】

Doing Homework again Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Othe...
• lin14543
• 2015年07月31日 18:34
• 463

## hdu 1789 Doing Homework again 贪心算法

Doing Homework again Time Limit: 1000/1000 MS (Java/Others)     Memory Limit: 32768/32768 K (Java/Ot...
• LYHVOYAGE
• 2013年01月22日 08:26
• 2346

## hdu1074Doing Homework【状态压缩】

Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of h...
• zhou_yujia
• 2016年01月07日 09:45
• 561

## hdu 1789 Doing Homework again

• yyf573462811
• 2012年07月30日 14:04
• 384

## HDU 1789 Doing Homework again！

Online Judge Online Exercise Online Teaching Online Contests Exercise Author F.A.Q Hand In...
• ultimater
• 2012年04月14日 17:55
• 954

## HDU 1789 Doing Homework again

• Dinivity123
• 2013年01月23日 08:20
• 500

## hdu 1789 doing homework again

http://acm.hdu.edu.cn/showproblem.php?pid=1789 Doing Homework again Time Limit: 1000/1000 MS (Ja...
• cscj2010
• 2011年09月22日 00:36
• 659

举报原因： 您举报文章：HDU 1789 Doing Homework again 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)