BestCoder Round #58 (div.2)HDU5494 Card Game

Card Game

                                                         Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
                                                                                      Total Submission(s): 256    Accepted Submission(s): 199
                   

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)

出题人：由于都是随机出牌, Soda要必胜显然是他的最小的$m$张牌的

和要大于Beta最大的$m$张牌的和.

#include 
   
   
    
    
#include 
    
    
     
     
#include 
     
     
      
      
using namespace std;
const int N=1000;
int a[N],b[N];
int main()
{
    int n,m,T,i,j;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        for(i=0; i
      
      
       
       maxn) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}