BestCoder Round #58 (div.2)Card Game(hdu5494)
2015-10-03 22:02
218 查看
Card Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 46 Accepted Submission(s): 42
Problem Description
Soda and Beta are good friends. They are going to play a card game today. Soda has n cards
with number a1,a2,...,an while
Beta has n cards
with number b1,b2,...,bn.
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.
Input
There are multiple test cases. The first line of input contains an integer T(1≤T≤100),
indicating the number of test cases. For each test case:
The first line contains two integer n and m (1≤m≤n≤500).
The second line contains n integers a1,a2,...,an (1≤ai≤1000) denoting
Soda's cards. The third line contains n integers b1,b2,...,bn (1≤bi≤1000) denoting
Beta's cards.
Output
For each test case, output "YES" (without the quotes) if Soda can always win, otherwise output "NO" (without the quotes) in a single line.
Sample Input
2 3 1 4 5 6 1 2 3 5 2 3 4 7 8 9 3 4 5 2 3
Sample Output
YES NO
Source
BestCoder Round #58 (div.2)
简单题,直接上代码。
哎!由于题目看错导致WA一发
相关文章推荐
- ksh 文件测试
- 【Pascal】 天软提取期权数据代码
- Find the Duplicate Number【287】
- 基础知识点
- php第五章
- Java多线程实验
- 项目自动化工具Ant和Maven初探
- php第四章
- php第三章
- php第二章
- php第一章
- C打印函数printf的一种实现原理简要分析
- Spring DI 继承
- php设计模式之观察者模式
- C打印函数printf的一种实现原理简要分析
- Photoshop设计时尚绚丽的电影海报教程
- bzoj1529【poi005】ska Piggy banks
- 如何解决U盘拷贝时提示文件过大问题
- Windows 7 64位PL/SQL Developer 连接Oracle 11g
- UVALive 4727 Jump(约瑟夫环,递推)