HDU 1789 Doing Homework again
来源:互联网 发布:影楼设计软件 编辑:程序博客网 时间:2024/06/08 17:02
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
从前往后估计会比较难,这道题简单的做法,是用贪心,从最后一天往前判断当天要做的题目(因为做题顺序无关,只考虑总收益最大)。从前往后判断,将会有多种可能性;而每一个最后一天,它只需要取当前期限内的最优解(最大值)。
#include <iostream>#include <cstdio>#include <algorithm>#include <map>using namespace std;int day[1005], scores[1005];int main(){int t, n;cin >> t;while (t--){multimap<int, int> homework;cin >> n;for (int i = 0; i < n; i++)scanf_s("%d", &day[i]);for (int i = 0; i < n; i++)scanf_s("%d", &scores[i]);for (int i = 0; i < n; i++)homework.insert(pair<int, int>(day[i], scores[i]));for (int d = homework.rbegin()->first; d > 0; d--){multimap<int, int>::iterator it, maxIt;int max = -1;for (it = homework.begin(); it != homework.end() && it->first < d; it++);if (it != homework.end()){for (; it != homework.end(); it++){if (it->second > max){max = it->second;maxIt = it;}}homework.erase(maxIt);}}int minus = 0;for (multimap<int, int>::iterator it = homework.begin(); it != homework.end(); it++){minus += it->second;}cout << minus << endl;}return 0;}
"I am a man of fortune,and I must seek my fortune."
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
- 测鬼记(上)——报到(二)
- JDK、JRE、JVM三者的区别
- Linux系统与Windows系统中的回车与换行问题
- LeetCode上Roman to Integer的C++代码
- Java的优点
- HDU 1789 Doing Homework again
- Pandas数值计算与排序
- 浅谈BitMap
- 大数据的解决方案--------批量读取和延迟修改
- C/C++计算一重定积分和二重定积分(纯暴力算法实现)
- 中国计算机学会CCF推荐国际学术会议和期刊目录
- 谷哥的小弟学后台(36)——MyBatis的原始Dao开发方式
- C#7.0之ref locals and returns (局部变量和引用返回,之前欠大家的,现在补上)
- 测鬼记(上)——入职(三)