hdu5494 Card Game（BestCoder Round #58 (div.2)）

Card Game

Accepts: 432

Submissions: 628

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

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

题意：两个人玩游戏；每人有一个序列，共n个数，从中取出m个数，比较m个数的和的大小。

分析：只要第一个人的最小的数比第二个人最大的数还要大就可以了。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;
#define ll long long
#define CL(a) memset(a,0,sizeof(a))

int main ()
{
    int T,n,m;
    int a[1111],b[1111];
    cin>>T;
    while (T--)
    {
        cin>>n>>m;
        for (int i=0; i<n; i++)
            cin>>a[i];
        for (int i=0; i<n; i++)
            cin>>b[i];
        sort(a, a+n);
        sort(b, b+n);
        int suma=0,sumb=0;
        for (int i=1; i<=m; i++)
        {
            suma+=a[i-1];
            sumb+=b[n-i];
        }
        if (suma>sumb)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}