zoukankan      html  css  js  c++  java
  • HDU1789Doing 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
    

    Author

    lcy

    Source

    2007省赛集训队练习赛(10)_以此感谢DOOMIII 
    #include<stdio.h>
    #include<math.h>
    #include<stdlib.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    const int maxn=1000+10;
    struct node{
        int dl,sco;
        bool flag;//flag表示可以完成 
    }a[maxn];
    bool cmp(node a1,node a2){
        if(a1.dl!=a2.dl)return a1.dl<a2.dl;
        else return a1.sco>a2.sco;
    }
    int main()
    {
        int N,n,i;
        scanf("%d",&N);
        while(N--)
        {
            scanf("%d",&n);
            for(i=0;i<n;i++)scanf("%d",&a[i].dl);
            for(i=0;i<n;i++)scanf("%d",&a[i].sco);
            for(i=0;i<n;i++)a[i].flag=true;
            sort(a,a+n,cmp);
            int day=1,res=0;
            for(i=0;i<n;i++)
            {
                if(a[i].dl>=day){
                    day++;
                    continue;
                }
                int p=a[i].sco,pos=i;
                for(int j=0;j<i;j++)
                {
                if(a[j].sco<p&&a[j].flag==1)
                {
                    p=a[j].sco;
                    pos=j;
                }
                }
                res+=p;
                a[pos].flag=0;
            }
            printf("%d
    ",res);    
        }
        return 0;
    }
  • 相关阅读:
    取多列数据的最大值、最小值sql
    java中实现时间差的计算
    数据更新sql
    自连接的用法sql
    获取第一条,最后一条数据sql
    复制表结构 表数据sql
    用 ORDER BY 生成“排序”列sql
    表之间的数据匹配(生成交叉表)sql
    SIP呼叫流程
    如何在WindowsPhone Bing Map控件中显示必应中国中文地图、谷歌中国中文地图。
  • 原文地址:https://www.cnblogs.com/Annetree/p/5509534.html
Copyright © 2011-2022 走看看