【贪心】【HDOJ-1338】Game Prediction

Problem Description

Suppose there are M people, including you, playing a special card game. At the beginning, each player receives N cards. The pip of a card is a positive integer which is at most N*M. And there are no two cards with the same pip. During a round, each player chooses one card to compare with others. The player whose card with the biggest pip wins the round, and then the next round begins. After N rounds, when all the cards of each player have been chosen, the player who has won the most rounds is the winner of the game. 
Given your cards received at the beginning, write a program to tell the maximal number of rounds that you may at least win during the whole game.

 

 

Input

The input consists of several test cases. The first line of each case contains two integers m (2 <= m <= 20) and n (1 <= n <= 50), representing the number of players and the number of cards each player receives at the beginning of the game, respectively. This followed by a line with n positive integers, representing the pips of cards you received at the beginning. Then a blank line follows to separate the cases. 

The input is terminated by a line with two zeros.

 

 

Output

For each test case, output a line consisting of the test case number followed by the number of rounds you will at least win during the game.

 

 

Sample Input

2 5 1 7 2 10 9 6 11 62 63 54 66 65 61 57 56 50 53 48 0 0

 

 

Sample Output

Case 1: 2 Case 2: 4

 

/***********************************************************************************************************************
题意：纸牌游戏，有m个人 每人n张牌 每人每轮出一张 点数最大的获胜 求至少获胜的次数
思路：把自己手里的牌降序排序 再把对手的牌降序排序 从大的出 如果自己的牌比对手小 则无法获胜 否则获胜
**********************************************************************************************************************/
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
int a[1000+10], b[1000+10];
bool cmp(int a, int b)
{
    return a > b;
}
int main()
{
    //freopen("data.in" , "r" , stdin);
    int m , n ;
    int cas = 0;
    while(scanf("%d %d", &m, &n) && m + n)
    {
        memset(a , 0 ,sizeof(a));
        int num = 0;
        for(int i = 0 ; i < n ; i ++)
            scanf("%d", &a[i]);
        sort(a, a + n, cmp);
        for(int i = n * m,  j = 0 ; i > 0 ; i --)
        {
            if(i == a[num])
            {
                num++;
                continue;
            }
            b[j++] = i;
        }
        int ans = 0;
        for(int i = 0, j = 0 ; i < n ; i ++)
        {
            if(a[i] < b[j])
                j++;
            else
                ans++;
        }
        printf("Case %d: %d\n" ,++cas ,ans);
    }
}