cf Round #646 (Div. 2)A题

A. Odd Selection
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output

Shubham has an array a of size n, and wants to select exactly x elements from it, such that their sum is odd. These elements do not have to be consecutive. The elements of the array are not guaranteed to be distinct.

Tell him whether he can do so.

Input
The first line of the input contains a single integer t (1≤t≤100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains two integers n and x (1≤x≤n≤1000) — the length of the array and the number of elements you need to choose.

The next line of each test case contains n integers a1,a2,…,an (1≤ai≤1000) — elements of the array.

Output
For each test case, print “Yes” or “No” depending on whether it is possible to choose x elements such that their sum is odd.

You may print every letter in any case you want.

Example
input
5
1 1
999
1 1
1000
2 1
51 50
2 2
51 50
3 3
101 102 103
output
Yes
No
Yes
Yes
No
Note
For 1st case: We must select element 999, and the sum is odd.
For 2nd case: We must select element 1000, so overall sum is not odd.
For 3rd case: We can select element 51.
For 4th case: We must select both elements 50 and 51 — so overall sum is odd.
For 5th case: We must select all elements — but overall sum is not odd.

大致题意：一共有t组样例，对于每组样例，有n个数，你的任务是在n个数中选择x个数，使得他们的和为奇数，若能完成这个任务，则输出’YES’,否则输出’NO’
思路：暴力，他们的和为奇数，则有奇数个奇数，假设有(2 * i - 1)个奇数，则需要(x - (2 * i - 1))个偶数，酱紫的话他们的和必定为奇数
以下是ac代码：

#include <iostream>
#include<bits/stdc++.h>
using namespace std;

int main()
{
    int T;
    scanf("%d", &T);
    while(T--){
        int n, x, totodd = 0;
        scanf("%d%d", &n, &x);
        for(int i = 1; i <= n; i++)
        {
            int c;
            scanf("%d", &c);
            if(c % 2 == 1)
                totodd++;
        }
        int toteven = n - totodd;
        bool flag = false;
        for(int i = 1; i <= totodd; i += 2)
        {	
        	/*注意偶数的个数即x-i需要>=0*/
            if(toteven >= x - i && x - i >= 0)
            {
                flag = true;
                break;
            }
        }
        if(flag)printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}