hdoj 1789 Doing Homework again 【贪心】
来源:互联网 发布:java开发项目经历 编辑:程序博客网 时间:2024/05/16 07:42
贪心策略:先按分数从大到小排序,分数一样,再按时间从小到大排序 分最高的越靠近期限完成,越好 话不多说直接看代码
题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=1789
代码:
#include<cstdio>#include<cstring>#include<algorithm>using std::sort;typedef struct{int sco, time;}str;str s[1005];bool vis[1005]; //标记第n天有没有被用int cmp(str a, str b) //排序{if(a.sco == b.sco) return a.time < b.time;return a.sco > b.sco;}int main(){int t, n, i, j;scanf("%d", &t);while(t --){scanf("%d", &n);for(i = 0; i < n; i ++)scanf("%d", &s[i].time);for(i = 0; i < n; i ++)scanf("%d", &s[i].sco);memset(vis, 0, sizeof(vis));int sum = 0;sort(s, s+n, cmp);for(i = 0; i < n; i ++){for(j = s[i].time; j >= 1; j --){ //按照时间从后往前查找没有被用过的天数if(!vis[j]){vis[j] = 1;break;}}if(j == 0) //如果找到最后都被用了 就算是该分数拿不到了sum +=s[i].sco;}printf("%d\n", sum);}return 0;}
0 0
- HDOJ 1789 Doing Homework again贪心
- HDOJ 1789 Doing Homework again (贪心)
- hdoj 1789 Doing Homework again 【贪心】
- hdoj--1789--Doing Homework again(贪心模拟)
- HDOJ 1789-Doing Homework again【贪心】
- HDOJ.1789 Doing Homework again (贪心)
- HDOJ 1789 Doing Homework again
- hdoj 1789 Doing Homework again
- hdoj 1789 Doing Homework again
- hdoj 1789 Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ-1789 Doing Homework again
- hdoj 1789 Doing Homework again
- hdoj-1789-Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ 1789 Doing Homework again
- HDOJ-1789 Doing Homework again
- JS操作JSON总结
- app跨域请求
- hdu1018 Big Number
- 控制照明系统,免费DMX灯光设计软件
- __STL_CLASS_PARTIAL_SPECIALIZATION
- hdoj 1789 Doing Homework again 【贪心】
- ehcache配置二级缓存
- iOS Interview Questions with Answers part3
- 指南在购买游戏机作为礼物送给2010年圣诞节
- 键盘事件的响应步骤
- Bachet's Game - UVa 10404 dp博弈论
- (数电学习笔记) 第一道逻辑设计题
- HBase复制
- 【Java】BlockingQueue深入分析