hdu 4310
来源:互联网 发布:小猪php在线解密 编辑:程序博客网 时间:2024/05/16 10:34
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.
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 Sample Output
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.
110 22100 11 100
20201
emmm........注意清零清零 ,除法特别小心~。~ int double,贪心dps/hp
#include<iostream>#include<algorithm>using namespace std;int ans,n;struct hero{ double dps; double hp; bool operator <(hero const & other )const { if(dps<other.dps)return false; return true; }};hero h[25];hero dpss[25];double hurt[25];int main(){ while(cin>>n) { ans=0; for(int i=0;i<25;i++){dpss[i].dps=0;dpss[i].hp=0;hurt[i]=0;}//清零 for(int i=0;i<n;i++){cin>>h[i].dps>>h[i].hp;} for(int i=0;i<n;i++) { dpss[i].dps=h[i].dps/h[i].hp; dpss[i].hp=h[i].hp; } sort(dpss,dpss+n);//将dps/hp的值由大到小拍排一次 for(int i=0;i<n;i++) { for(int j=i;j<n;j++) { hurt[i]+=(dpss[j].dps*dpss[j].hp)*dpss[i].hp; } ans+=hurt[i]; } cout<<ans<<endl; }}
阅读全文
0 0
- hdu 4310
- hdu 4310
- HDU-4310
- HDU 4310
- HDU 4310
- hdu 4310
- hdu 4310 hero #贪心
- hdu 4310 heros
- hdu 4310 Hero
- hdu 4310 简单贪心
- hdu 4310 Hero 贪心
- hdu 4310 (水)
- hdu 4310 Hero
- hdu 4310 Hero
- hdu 4310 hero
- hdu(4310)
- HDU 4310 Hero
- hdu 4310(水一题贪心)
- 谈谈MySQL隐式类型转换
- 二分起步---Can you find it?
- Ubuntu 建立subversion与redmine关联
- 032day(STL中的二分查找算法)
- 基于JavaMail的Java邮件发送:简单邮件发送
- hdu 4310
- verilog编译指令
- 互斥锁和条件变量在实际开发中的应用
- Python3 简单抓取网站url
- Maven基础
- Sass的使用(让css更优雅和强大)---第一节
- SQL之数据库的定义与基本操作
- 为什么i++后,i++的值不变
- Mybatis学习笔记(十三)【多对多查询】