ACM ICPC 家庭作业优化-CSDN博客

本文链接：https://blog.csdn.net/jianxingzhang/article/details/79668270

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.

InputThe 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.
OutputFor 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

此题用了个结构体排序

先按分数大到小在按日期小到大

详解代码啦啦啦啦啦hhh

///先按分数排序 再按日期小到大
#include <cstdio>
#include <iostream>
#include <cstring>
#include  <queue>
#include <algorithm>
#include <map>
using namespace std;
int visit[100004];  标记那天有没有作业做
struct hom
{
    int da;
    int sc;
}s[1005];
bool cmp( hom  x , hom y )
{
    if( x.sc !=  y.sc )
    return x.sc > y.sc;
    else
    if( x.da != y.da )
    return x.da < y.da;
    return false;
}
int main()
{
    int t;
    scanf("%d", &t);
    while( t-- )
    {
        memset( visit , 0, sizeof( visit ));
        memset( s, 0, sizeof( s ));
        int n, i, j ;
        scanf("%d", &n);
        for( i = 0; i<n; i++)
        {
            scanf("%d", &s[i].da);
        }
        for( i =0; i<n; i++)
        {
            scanf("%d", &s[i].sc);
        }
        sort( s , s+n, cmp);
        int sum = 0;
        for( i = 0; i<n; i++)
        {
            ///cout<<s[i].sc<<endl;
            int tt = 0;
            for( j = s[i].da ; j>0; j--)向前查日期
            {
                if( visit[j] == 0 )哇哇 这天没有任务 很好 那这天就做这个作业了
                {
                    tt = 1;
                    visit[j] = 1;
                    break;
                }
            }
            if( tt == 0)
                sum = sum + s[i].sc;
        }
        printf("%d\n", sum);
    }
    return 0;
}