关闭

HDU 1789 Doing Homework again

标签: 算法ACM
58人阅读 评论(0) 收藏 举报
分类:

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;
    }
}

体会:排序解决问题也挺不错的

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:4266次
    • 积分:611
    • 等级:
    • 排名:千里之外
    • 原创:60篇
    • 转载:0篇
    • 译文:0篇
    • 评论:0条
    文章分类