HDU 1789 Doing Homework again

原创 2016年08月30日 10:16:07

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

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

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU 1789 Doing Homework again

题目: Description Ignatius has just come back school from the 30th ACM/ICPC. Now he ha...

hdu 1789 Doing Homework again

题目描述: Doing Homework again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K...

【贪心】 hdu1789 Doing Homework again

Doing Homework again http://acm.hdu.edu.cn/showproblem.php?pid=1789 Problem Description ...

HDU-1789-Doing Homework again

 Doing Homework again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Jav...

HDU 1789 Doing Homework again(贪心算法)

Doing Homework again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Ot...

HDU 1789 Doing Homework again 经典贪心

题意:有t组测试数据,每组测试数据中有n门功课,第一排完成它们的时间限制,第二排是未在限制的时间内完成的要扣除的分数,然后是需要求扣的分数最少。 思路:先按照扣分从大到小排序,分数相同则按照...

hdu1789 Doing Homework again (贪心+优先队列)

Doing Homework again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Ot...

HDU 1789 Doing Homework again

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1789 Problem Description Ignatius has just come b...

HDU 1789 Doing Homework again(贪心)

Doing Homework again Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Ot...

HDU ACM 1789 Doing Homework again

原题描述Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lo...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)