Game Prediction（贪心）

Game Prediction（贪心）

Game Prediction

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

Submit  ​​Status​​​  ​​​Practice​​​  ​​​POJ 1323​​

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?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.

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

//N*M发排问题、#include#include#include#includeusing namespace std;int n,m;int a[1005];int main(){ int d=1; while(~scanf("%d%d",&n,&m),(n&&m)) { int lose=0; int win=0; for(int i=1;i<=m;i++) scanf("%d",&a[i]); sort(a+1,a+1+m); for(int i=n*m;i>=1&&m>0;i--) { if(a[m]!=i) lose++; else { if(lose) { lose--; } else { win++; } m--; } } printf("Case %d: %d\n",d++,win); }}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。