Hdu1789 Doing Homework again 贪心

最新推荐文章于 2020-09-15 22:01:17 发布

dregs_

最新推荐文章于 2020-09-15 22:01:17 发布

阅读量120

点赞数

本文链接：https://blog.csdn.net/dregs_/article/details/106316566

版权

#include <bits/stdc++.h>
using namespace std;
#define ll long long

struct node{
    int deadline,reduce;
    // int operator<(const node &o)const{
    //     return o.reduce - reduce;
    // }
}no[100005];
bool cmp(node a,node b){
    return a.reduce > b.reduce;
}
int main()
    {
        bool vis[10100];
        int n,i,q,p,a,b,x,y,t;
        cin >> t;
        while(t--){
            cin >> n;
            for (int i = 0; i < n;i++){
                cin >> no[i].deadline;
            }
            for (int i = 0; i < n;i++){
                cin >> no[i].reduce;
            }
            sort(no, no + n,cmp);
            memset(vis,false, sizeof(vis));
            vis[0] = true;
            // for (int i = 1; i < n;i++)
            //     vis[i] = false;
            long sum = 0;
            int j;
            for (int i = 0; i < n;i++){
                // cout << no[i].reduce << " ";
                for (j = no[i].deadline; j > 0; j--)
                {
                    if(!vis[j]){
                        vis[j] = true;
                        break;
                    }
                }
                if(j==0)
                    sum += no[i].reduce;
            }
            cout << sum << endl;
        }
        return 0;
    }
    /*
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

 0
 3
 5
*/