关闭

HDU ACM 1789 Doing Homework again

标签: acm贪心
529人阅读 评论(2) 收藏 举报
分类:

原题描述

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

解题思路

将所有作业按照扣分数从大到小排序,先做扣分多的。
开一个数组记录当天是否被使用,然后枚举所有作业。
从一个作业的deadline向前枚举日期,如果发现空日期则做作业并占用日期,如果前面所有日期都满了则扣分。
累计扣分并输出。

参考代码

#include <iostream>
#include <algorithm>
using namespace std;

struct work             // 作业结构
{
    int deadline;
    int score;
    bool operator< (const work & w)const    // 重载<,作为比较函数
    {
        // 扣分越高越靠前
        return (score > w.score);
    }
}W[1001];
int taken[1001];                        // 当天是否被使用

int main()
{
    int t, n, i, j, ans;
    cin >> t;
    while(t--)
    {
        memset(taken, 0, sizeof(taken));// 0表示没有使用,1表示使用
        ans = 0;
        cin >> n;
        for (int i = 0; i < n;i++)
        {
            cin >> W[i].deadline;
        }
        for (int i = 0; i < n;i++)
        {
            cin >> W[i].score;
        }
        sort(W, W + n);                 // 使用重载的<符号排序

        for (i = 0; i < n;i++)      // 枚举每一个作业
        {
            for (j = W[i].deadline; j > 0;j--)      // 这个作业的deadline向前枚举日期,直到找到空的日子做作业
            {
                if(!taken[j])
                {
                    taken[j] = 1;
                    break;
                }
            }
            if (j == 0)                 // 如果没有找到空日子,那么扣分
                ans += W[i].score;
        }
        cout << ans << endl;
    }
}
0
0
查看评论

HDU - 1789 Doing Homework again

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 ha...
  • u011345136
  • 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/Others) Total Submission(s): 86...
  • baidu_29410909
  • baidu_29410909
  • 2015-07-29 23:25
  • 338

HDU1789:Doing Homework again

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...
  • libin56842
  • libin56842
  • 2013-03-14 20:47
  • 2531

HDU1789:Doing Homework again 【贪心】

Doing Homework again Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 42 &#...
  • lin14543
  • lin14543
  • 2015-07-31 18:34
  • 467

HDU1074:Doing Homework(状态压缩DP)

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...
  • libin56842
  • libin56842
  • 2014-04-22 17:01
  • 6271

hdu 1789 Doing Homework again 贪心算法

Doing Homework again Time Limit: 1000/1000 MS (Java/Others)     Memory Limit: 32768/32768 K (Java/Others)   Problem Descri...
  • LYHVOYAGE
  • LYHVOYAGE
  • 2013-01-22 08:26
  • 2350

HDU 1789 Doing Homework again

这是一道贪心类的题目。题目的大意是说Ignatius每天能够完成一项课程,然而每门课都有截止日期,如果Ignatius没能在截止日期完成的话就会扣除他相应的分数。让你求所扣除最少的分数。这道题先将截至日期从小到大排序,然后一天天的过,用一个数组来标记完成的课程,如果碰见截至日期是一样的,就将截至日期...
  • Dinivity123
  • Dinivity123
  • 2013-01-23 08:20
  • 500

hdu 1789 Doing Homework again

贪心算法。 给你一个n代表功课的数目,下面两行各有n个数,第一行的n个数表示功课的截止日期,第二行表示不按时上交的话,所扣的分数。 求怎样安排,所口的分数最小。 首先按分数从大到小排序,若分数相同按时间从小到大排序, 然后,进行循环,当这一天没有功课被的话,将此功课安排大盘这一天,如果,这一...
  • yyf573462811
  • yyf573462811
  • 2012-07-30 14:04
  • 385

HDU 1789 Doing Homework again!

Online Judge Online Exercise Online Teaching Online Contests Exercise Author F.A.Q Hand In Hand Online Acmers Forum | Discuss Stati...
  • ultimater
  • ultimater
  • 2012-04-14 17:55
  • 959

hdu1074Doing Homework【状态压缩】

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 ...
  • zhou_yujia
  • zhou_yujia
  • 2016-01-07 09:45
  • 568
    个人资料
    • 访问:40857次
    • 积分:1022
    • 等级:
    • 排名:千里之外
    • 原创:61篇
    • 转载:11篇
    • 译文:0篇
    • 评论:7条
    最新评论