A927.Talent Show--Gold
提高+/省选-
通过率:0%
时间限制:1.00s
内存限制:128MB
题目描述
Farmer John is bringing his N cows, conveniently numbered 1…N, to
the county fair, to compete in the annual bovine talent show! His ith cow
has a weight wi and talent level ti, both integers.
Upon arrival, Farmer John is quite surprised by the new rules for this year's
talent show:
(i) A group of cows of total weight at least W must be entered into the show
(in order to ensure strong teams of cows are competing, not just strong
individuals), and
(ii) The group with the largest ratio of total talent to total weight shall
win.
FJ observes that all of his cows together have weight at least W, so he
should be able to enter a team satisfying (i). Help him determine the optimal
ratio of talent to weight he can achieve for any such team.
输入格式
The first line of input contains N (1≤N≤250) and W (1≤W≤1000). The next N lines each describe a cow using two integers wi
(1≤wi≤106) and ti (1≤ti≤103).
输出格式
Please determine the largest possible ratio of total talent over total weight
Farmer John can achieve using a group of cows of total weight at least W. If
your answer is A, please print out the floor of 1000A in order to keep the
output integer-valued (the floor operation discards any fractional part by
rounding down to an integer, if the number in question is not already an
integer).
输入输出样例
输入#1
3 15 20 21 10 11 30 31
输出#1
1066
说明/提示
In this example, the best talent-to-weight ratio overall would be to use just
the single cow with talent 11 and weight 10, but since we need at least 15
units of weight, the optimal solution ends up being to use this cow plus the
cow with talent 21 and weight 20. This gives a talent-to-weight ratio of
(11+21)/(10+20) = 32/30 = 1.0666666..., which when multiplied by 1000 and
floored gives 1066.