zoukankan      html  css  js  c++  java
  • HDU 1789 Doing Homework again(馋)

    意甲冠军  参加大ACM竞争是非常回落乔布斯  每一个工作都有截止日期   未完成必要的期限结束的期限内扣除相应的积分   求点扣除的最低数量

    把全部作业按扣分大小从大到小排序  然后就贪阿  能完毕前面的就完毕前面的  实在不能的就扣分吧~

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    const int N = 1005;
    int dli[N], red[N], k[N], cas, ans, n;
    bool vis[N];
    
    bool cmp (int i, int j)
    {
        return red[i] > red[j];
    }
    
    int main()
    {
        scanf ("%d", &cas);
        while (cas--)
        {
            ans = 0;
            memset (vis, 0, sizeof (vis));
            scanf ("%d", &n);
            for (int i = 1; i <= n; ++i)
                scanf ("%d", &dli[i]), k[i] = i;
            for (int j = 1; j <= n; ++j)
                scanf ("%d", &red[j]);
                
            sort (k + 1, k + n + 1, cmp);
            for (int i = 1, j; i <= n; ++i)
            {
                for (j = dli[k[i]]; j >= 1; --j)
                    if (!vis[j])
                    {
                        vis[j] = 1;
                        break;
                    }
                if (j == 0) ans += red[k[i]];
            }
            printf ("%d
    ", ans);
        }
        return 0;
    }<span style="font-family:Comic Sans MS;">
    </span>

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



    版权声明:本文博主原创文章。博客,未经同意不得转载。

  • 相关阅读:
    巨人的崛起 Android操作系统发展历程
    iPhone 4S定位功能加强 支持GLONASS系统
    android子线程更新UI,与主Thread一起工作
    什么在阻碍移动互联网的普及?
    WEB.CONFIG 配置详解
    解决在aspx页面上进行传中文参数时会出现乱码问题
    VS2005水晶报表注册码
    windows2003应用程序池假死的问题
    浅谈ASP.NET内部机制
    合理建立数据库索引
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/4912591.html
Copyright © 2011-2022 走看看