HDU 1789 Doing Homework again【贪心】

/*
题目大意：

输入多组数据，第一行输入T，第二行输入一个正整数N，N表示有N门课程，之后的第一行输入N最后上交的日期，在后面一行输入对应科目迟交作业要扣掉的相应分数。
    输出总共扣的最少分数
解题思路：

    先对日期从小到大排序，如果日期相同，则扣分多的排在前面。如果相同日期内有扣分多的，则就用前面做扣分少的作业的时间来做这门作业；如果没有比他小的，就扣这门作业的分。

解题人：linnichong
解题时间：2014-10-29 02:02:46
解题体会：在对日期从小到大排序还知道怎么去做，但后面的用红字写的实在没想到。
*/

Doing Homework again

Time Limit: 1000/1000 MS (Java/Others)   

 Memory Limit: 32768/32768 K (Java/Others)

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

 

Source

2007省赛集训队练习赛（10）_以此感谢DOOMIII

 

Recommend

lcy

 

#include<stdio.h>
#include<algorithm>
using namespace std;
struct work
{
	int cos;
	int time;
	bool flag;
}a[1005];

bool cmp(work a1,work a2)
{
	if(a1.time !=a2.time)
		return a1.time < a2.time;
	return a1.cos > a2.cos;
}

int main()
{
	int T,n,i,j,k;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
			scanf("%d",&a[i].time);
		for(i=0;i<n;i++)
		{
			scanf("%d",&a[i].cos);
			a[i].flag = true; 
		}
		sort(a,a+n,cmp);
		int sum=0,k=1;
		for(i=0;i<n;i++)
		{
			if(a[i].time >= k)
			{
				k++;
				continue;
			}
			int p=a[i].cos,pas=i;
			for(j=0;j<i;j++)
				if(a[j].cos < p && a[j].flag)
				{
					p = a[j].cos;
					pas = j;
				}
			sum += p;
			a[pas].flag=false;
			
		}
		printf("%d\n",sum);
		
		
	}
	
	return 0;
}