题库练习 Talent Show--Gold
← 上一题 下一题 →

A942 | Talent Show--Gold

来源USACO
时间限制1s
内存限制128MB
通过 / 提交0/0

题目描述

Farmer John is bringing his $N$ cows, conveniently numbered $1 \ldots N$, to
the county fair, to compete in the annual bovine talent show! His $i$th cow
has a weight $w_i$ and talent level $t_i$, 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 \leq N \leq 250$) and $W$ ($1 \leq W
\leq 1000$). The next $N$ lines each describe a cow using two integers $w_i$
($1 \leq w_i \leq 10^6$) and $t_i$ ($1 \leq t_i \leq 10^3$).

输出格式

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
C++ 编辑器
输入
输出