# Doing Homework again

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8415    Accepted Submission(s): 4954

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.

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

Author
lcy

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <malloc.h>
#include <ctype.h>
#include <math.h>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
#include <stack>
#include <queue>
#include <vector>
#include <deque>
#include <set>
#include <map>

struct work
{
int d,s;
};
work wo[1010];

int cmp(work a,work b)
{
//if(a.s!=b.s)
return a.s>b.s;
//	return a.d>b.d;
}

map<int,bool>my;
int main()
{
int n;
int t;

scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
my.clear();
for(int i=0;i<n;i++)
scanf("%d",&wo[i].d);
for(int i=0;i<n;i++)
scanf("%d",&wo[i].s);
int ans=0;
sort(wo,wo+n,cmp);

for(int i=0;i<n;i++)
{
while(1)
{
if(my.count(wo[i].d)==0)
{
my[wo[i].d]=1;
break;
}
wo[i].d--;
if(wo[i].d==0)
{
ans+=wo[i].s;
break;
}
}
}
printf("%d\n",ans);
}
return 0;
}



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

## 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
• 466

## 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
• 2530

## HDU1074：Doing Homework(状态压缩DP)

Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of ...
• libin56842
• 2014年04月22日 17:01
• 6268

## HDU - 1074 Doing Homework

• u011345136
• 2014年07月02日 15:54
• 763

## 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
• 2349

## HDU 1789 Doing Homework again （贪心）

• dgq8211
• 2012年05月05日 19:05
• 1332

## HDU 1789 Doing Homework again(贪心)

Doing Homework again Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Ot...
• LiuJiuXiaoShiTou
• 2017年04月21日 16:23
• 262

## HDU Problem - 1789 Doing Homework again【贪心】

Doing Homework again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/...
• lututu123
• 2016年07月23日 16:45
• 112

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