【每日一题(10)】Hero HDU-4310
来源:互联网 发布:液晶电视怎么连接网络 编辑:程序博客网 时间:2024/06/05 04:04
Hero HDU-4310
When playing DotA with god-like rivals and pig-like team members, you have to face an embarrassing situation: All your teammates are killed, and you have to fight 1vN.
There are two key attributes for the heroes in the game, health point (HP) and damage per shot (DPS). Your hero has almost infinite HP, but only 1 DPS.
To simplify the problem, we assume the game is turn-based, but not real-time. In each round, you can choose one enemy hero to attack, and his HP will decrease by 1. While at the same time, all the lived enemy heroes will attack you, and your HP will decrease by the sum of their DPS. If one hero’s HP fall equal to (or below) zero, he will die after this round, and cannot attack you in the following rounds.
Although your hero is undefeated, you want to choose best strategy to kill all the enemy heroes with minimum HP loss.
Input
The first line of each test case contains the number of enemy heroes N (1 <= N <= 20). Then N lines followed, each contains two integers DPSi and HPi, which are the DPS and HP for each hero. (1 <= DPSi, HPi <= 1000)
Output
Output one line for each test, indicates the minimum HP loss.
Sample Input
1
10 2
2
100 1
1 100
Sample Output
20
201
题意
这是个很有趣的贪心题,首先将敌人从伤害平均值从高往低排序
再一个个击倒,这道题中我使用的是STL中的优先队列
题解
#include<iostream>#include<cstdio>#include<queue>using namespace std;struct node{ int hp,dps;//dps:伤害 hp:血量 double vip; friend bool operator < (node a,node b){ return a.vip < b.vip; }};int main(void){ int n; while(scanf("%d",&n) != EOF){ priority_queue<node> q; node v; int cnt = 0,count = 0; while(n--){ scanf("%d %d",&v.dps,&v.hp); v.vip = (double)(v.dps)/(double)(v.hp); count += v.dps; q.push(v); } while(!q.empty()){ v = q.top(); cnt += (count * v.hp); count -= v.dps; q.pop(); } printf("%d\n",cnt); } return 0;}
- 【每日一题(10)】Hero HDU-4310
- hdu 4310 hero #贪心
- hdu 4310 Hero
- hdu 4310 Hero 贪心
- hdu 4310 Hero
- hdu 4310 Hero
- hdu 4310 hero
- HDU 4310 Hero
- hdu 4310 Hero
- HDU 4310 Hero
- 贪心--HDU - 4310 Hero
- hdu 4310 Hero
- HDU 4310 Hero(贪心)
- hdu 4310 Hero
- HDU 4310 Hero
- HDU 4310 Hero
- HDU 4310 Hero
- HDU 4310 Hero【贪心】
- linux实现彩色进度条,rpm和yum安装的区别和进程的task_struck结构
- CSAPP第三章学习笔记(二)
- Java开发-Java中代理设计模式的实现
- 【每日一题(9)】Duizi and Shunzi HDU
- LeetCode:Best Time to Buy and Sell Stock with Transaction Fee
- 【每日一题(10)】Hero HDU-4310
- 抖动
- 平时工作中一定会用到的Linux指令(每周会持续更新~)
- md5加密
- Android自定义View实现自动无限轮播,点击图片进入详情页
- 高数-二重积分
- STM32学习笔记之USB虚拟串口描述符简介
- HDOJ 1018 数学题(N阶乘位数)
- linux写时复制技术