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.
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?20) and n (1?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.
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
每次出最大的。。如果别人手中最大的小于你的。得分+1,而对方则选择最小的一个扔掉。
如果对方最大的大于你手中最大的,对方会选择自己手中最小但是比你最大的大的牌丢掉。。。。。
也就是说,从最大点数的牌一直搜下去,如果在我的牌中找到,就s++,否则别人就会把他的大牌拿出来跟我比,他就会t--了!
如果我没有那张牌,他就又多了一张比我大的牌就t++了,t代表他牌比我大的张数;
s最大的时候就是我至少赢的次数。。。
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{
int m,n,i,j,t,k,s,a[1010],c=1;
while(scanf("%d%d",&n,&m)&&n+m)
{
memset(a,0,sizeof(a)); //一定要记得把a全部清0
for(i=0;i<m;i++)
{
scanf("%d",&k);
a[k]=1;
}
s=t=0;
for(i=m*n;i>0;i--)
if(a[i])
{
if(t==0)
s++;
else
t--;
}
else
t++;
printf("Case %d: %d\n",c++,s);
}
return 0;
}