Doing Homework again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16614 Accepted Submission(s): 9684
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
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
思路:用一个优先队列辅助就行了,优先时间,时间有冲突的优先分值。
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<vector>
#include<queue>
using namespace std;
struct node{
int time;
int val;
}mat[1005];
int cmp(node a,node b)
{//优先时间
return a.time<b.time;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
int sum=0;
priority_queue<int,vector<int>,greater<int> >q;//升序排列
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&mat[i].time);
}
for(int i=0;i<n;i++)
{
scanf("%d",&mat[i].val);
sum+=mat[i].val;
}
sort(mat,mat+n,cmp);
for(int i=0;i<n;i++)
{
if(mat[i].time>q.size())//队列元素个数代表已消耗时间
{//最晚结束时间>已消耗时间,可做
sum-=mat[i].val;//减去已做分数
q.push(mat[i].val);
}
else
{//时间有冲突,优先分值大的
sum-=mat[i].val;//先当做了
q.push(mat[i].val);
sum+=q.top();//谁分值小舍弃谁
q.pop();
}
}
printf("%d\n",sum);
}
return 0;
}