当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5494:Card Game

题目描述
Soda and Beta are good friends. They are going to play a card game today. Soda has $n$ cards with number $a_1, a_2, ..., a_n$ while Beta has $n$ cards with number $b_1, b_2, ..., b_n$.

First, they choose a number $m$ no larger than $n$. Then they both randomly select $m$ cards from their own $n$ cards. The one with larger sum of the selected cards will win. Soda wants to know if he can always win no mater what cards will be randomly selected from him and Beta.
输入解释
There are multiple test cases. The first line of input contains an integer $T (1 \le T \le 100)$, indicating the number of test cases. For each test case:

The first line contains two integer $n$ and $m$ $(1 \le m \le n \le 500)$. The second line contains $n$ integers $a_1, a_2, ..., a_n$ $(1 \le a_i \le 1000)$ denoting Soda's cards. The third line contains $n$ integers $b_1, b_2, ..., b_n$ $(1 \le b_i \le 1000)$ denoting Beta's cards.
输出解释
For each test case, output "YES" (without the quotes) if Soda can always win, otherwise output "NO" (without the quotes) in a single line.
输入样例
2
3 1
4 5 6
1 2 3
5 2
3 4 7 8 9
3 4 5 2 3
输出样例
YES
NO
来自杭电HDUOJ的附加信息
Recommend hujie

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-5494

最后修改于 2020-10-25T23:23:09+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)