HDU 4310 Hero
来源:互联网 发布:淘宝贷款突然不能用了 编辑:程序博客网 时间:2024/06/06 07:14
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 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
贪心...
#include<iostream>(不知道是不是SDUTOJ上面的题,估计不是呀)#include<algorithm>using namespace std;struct list{ double d; double h; double bz;}p[50];int cmp(list a,list b){ return a.bz>b.bz;}int main(){ int i,a,j,k,num; double wh=0; while(cin>>a) { for(i=0;i<a;i++) { cin>>p[i].d>>p[i].h; p[i].bz=p[i].d/p[i].h; } sort(p,p+a,cmp); /*for(i=0;i<a;i++) { cout<<p[i].d<<' '<<p[i].h<<' '<<p[i].bz<<endl; }*/ j=0; num=a; while(a!=0) { for(i=p[j].h;i>0;i--) { for(k=0;k<num;k++) { wh+=p[k].d; } } p[j].d=0; j++; a--; } cout<<wh<<endl; wh=0; } return 0;}
阅读全文
0 0
- 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【贪心】
- HDU 4310 Hero(贪心)
- python输入整条数据分割存入数组
- iOS图片的处理
- Gartner发布2017年新兴科技技术成熟度曲线
- hadoop伪分布式的搭建
- 分页
- HDU 4310 Hero
- 浅谈ADB的认识(一)
- 习题16
- Android 点9图的绘制
- vs clean或rebuild时自动删除dll的解决方法
- 南阳OJ-题目198:数数
- HTTP协议请求中返回的各个状态码对应的状态信息
- Django点滴(2)xadmin+django-import-export导入导出的实现
- 卷积神经网络学习(一)——基本卷积神经网络搭建