Hero
Problem Description
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
Source
2012 Multi-University Training Contest 2题意:有n组敌人,每次攻击一个敌人会使这个敌人的HP减1,但是同时我的DPS(开始是是无穷的)的值会减少所有没消灭的敌人的DPS总和,要求将所有的敌人都消灭后我的DPS剩余的最多,即求耗费的DPS的值最少。
#include<stdio.h>
#include<stdlib.h>
struct haha
{
int gj;
int flood;
double val;
}per[100];
int cmp(const void *a,const void *b)
{
if((*(struct haha *)a).val!=(*(struct haha *)b).val)
return (*(struct haha *)a).val>(*(struct haha *)b).val?-1:1;
else return (*(struct haha *)b).gj-(*(struct haha *)a).gj;
}
int main()
{
int n,i;
__int64 sum,ans;
while(scanf("%d",&n)!=EOF)
{
sum=ans=0;
for(i=0;i<n;i++)
{
scanf("%d %d",&per[i].gj,&per[i].flood);
per[i].val=(double)per[i].gj/per[i].flood;
sum+=per[i].gj;
}
qsort(per,n,sizeof(per[0]),cmp);
for(i=0;i<n;i++)
{
ans+=per[i].flood*sum;
sum-=per[i].gj;
}
printf("%I64d\n",ans);
}
return 0;
}
分享到:
相关推荐
HDU的1250,主要是利用高精度加法,但是代码有点繁琐,效率不是很高
杭电ACMhdu1163
HDU1059的代码
hdu1001解题报告
hdu 1574 passed sorce
HDU的一题........HDU DP动态规
杭电ACM课件2014版之 (HDUACM201403版_03)贪心算法
hdu acm 教案 搜索入门 hdu acm 教案 搜索入门
hdu2101AC代码
搜索 dfs 解题代码 hdu1241
hdu 5007 Post Robot 字符串枚举。 暴力一下就可以了。
hdu acm 教案 动态规划(1) hdu acm 教案 动态规划(1)
ACM HDU题目分类,我自己总结的大概只有十来个吧
hdu1290 解题报告 献给杭电五十周年校庆的礼物 (切西瓜问题,即平面分割空间)
acm 技术大牛 课件 HDU 自学必备课件 全套齐全 (lecture_01)初识ACM (lecture_02)简单数学题 (lecture_03)递推求解 (lecture_04)动态规划(1)_ (lecture_05)计算几何基础_ (lecture_06)母函数 (lecture_...
hdu 1166线段树代码
HDU最全ac代码
hdu动态规划算法集锦
自己做的HDU ACM已经AC的题目
hdu题目分类