暑假集训(2)第八弹 —– Hero(hdu4310)

学OI已经9个月了,可是自己水平如故这样的弱QWQ.
今天离NOIP还有差不多100天的时间.
夜里折腾反侧发现了祥和的有的题材:
(1)DP还每每没思路.
(2)搜索恶心题还不想写.
(3)有时候也颓.
这一年来在机房里依然算比较能静下心来做题的(不过都是水题),
奇迹也颓:(1)玩dota类游戏(有时候甚至为了玩手机MOBA搭个Android模拟器).
(2)经常聊QQ(虽然有时侯也问个题).
(3)偶尔听听歌(可是我之前听的swift的歌现在都成付费的了QWQ).
发源SD一弱校,各类比赛名额都被强校多年占据.
加油吧!
到底一起头并不是为了什么好处,
一先导压根就没想过要因为那一个拿个如何资格考个咋样高校.
(到前些天毕竟了然了dzd助教的良苦用心).
毫无吐弃!
究竟将来是要搞ACM的.
到底未来是要用Java写Android的.
做题计划:(1)每一天2~4道USACO题
(2)每天1道DP题.
(3)每周周日抽出时间打模板.
接纳难走的路会看到更美的风景.
To better with you.
Bless All!
图片 1

K – Hero

Crawling in process… Crawling failed
Time Limit:3000MS     Memory
Limit:
65536KB     64bit IO Format:%I64d &
%I64u

Submit Status

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

1 10 2 2 100 1 1 100

 

Sample Output

20 201

 

 

题材浅析:dota啊,好久没玩过了,真……嗯,先总括出所有敌手造成的有害,然后用dps/hp(每点生命值造成伤害)作为排序的遵照,从大到小各种杀光,每杀一个便让总dp减去被杀的人的dp即可。

图片 2图片 3

 1 #include "iostream"
 2 #include "algorithm"
 3 
 4 using namespace std;
 5 struct enemy
 6 {
 7     int hp;
 8     int dp;
 9 };
10 enemy N[21];
11 enemy T[21];
12 int sum;
13 __int64 dead;
14 void ebegin(int n)
15 {
16   for (int i=1;i<=n;i++)
17     {
18       cin>>N[i].dp>>N[i].hp;
19       sum += N[i].dp;
20     }
21 }
22 void defeat (int n)
23 {
24   for (int i=1;i<=n;i++)
25   {
26      dead += sum * N[i].hp;
27       sum -= N[i].dp;
28   }
29    cout<<dead<<endl;
30 }
31 int compare (enemy x,enemy y)
32 {
33     return  x.hp * y.dp < x.dp * y.hp;
34 }
35 int main()
36 {
37     int n;
38     while (cin>>n)
39     {
40         dead = 0;
41         ebegin(n);
42         sort(N+1,N+n+1,compare);
43         defeat(n);
44     }
45     return 0;
46 }

View Code

 

相关文章

发表评论

电子邮件地址不会被公开。 必填项已用*标注

*
*
Website