HDU 1789 Doing Homework again(贪心)
来源:互联网 发布:大数据领域的权威人物 编辑:程序博客网 时间:2024/05/24 05:12
题意 某大参加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\n", 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.
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
333 3 310 5 131 3 16 2 371 4 6 4 2 4 33 2 1 7 6 5 4
Sample Output
035
0 0
- hdu 1789 Doing Homework again (贪心)
- hdu 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again(贪心~!)
- hdu 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again(贪心)
- hdu 1789 Doing Homework again(贪心)
- HDU-1789-Doing Homework again(贪心)
- HDU 1789 Doing Homework again(贪心)
- hdu 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again(贪心)
- HDU-1789-Doing Homework again(贪心)
- hdu 1789 Doing Homework again 贪心算法
- hdu 1789 Doing Homework again 贪心算法
- HDU 1789 Doing Homework Again( 贪心 )
- POJ 1856 Sea Battle(DFS)
- POJ 3481 Double Queue(STL)
- POJ 3087 Shuffle'm Up(模拟)
- 测试
- POJ 3282 Ferry Loading IV(模拟,队列)
- HDU 1789 Doing Homework again(贪心)
- Android 智能问答机器人的实现
- POJ 1692 Crossed Matchings(DP)
- Android之SurfaceView学习
- HDU 1114 Piggy-Bank(完全背包 DP)
- HDU 1160 FatMouse's Speed(DP)
- HDU 1078 FatMouse and Cheese(DP)
- HDU 1081 To The Max(DP)
- HDU 1501 Zipper(DP,DFS)