1056 Mice and Rice （25 分）分组求最大值

最新推荐文章于 2020-02-22 20:57:49 发布

大山喵

最新推荐文章于 2020-02-22 20:57:49 发布

阅读量1.2k

点赞数 7

分类专栏： PAT-Advanced Level 文章标签： A1056

本文链接：https://blog.csdn.net/CV_Jason/article/details/85238006

版权

在名为'Mice and Rice'的编程竞赛中，参赛者的代码控制着老鼠在地图上的行动，目标是吃最多的米。比赛通过分组决出最重的老鼠获胜。给定程序员数量、每组最大老鼠数及初始顺序，计算所有程序员的排名。输入包括程序员数量、每组老鼠数和各老鼠的体重及初始顺序。输出是各程序员的排名。解题关键在于正确分组并计算排名。

摘要由CSDN通过智能技术生成

题目

Mice and Rice is the name of a programming contest in which each programmer must write a piece of code to control the movements of a mouse in a given map. The goal of each mouse is to eat as much rice as possible in order to become a FatMouse.

First the playing order is randomly decided for $N_P$ programmers. Then every $N_G$ programmers are grouped in a match. The fattest mouse in a group wins and enters the next turn. All the losers in this turn are ranked the same. Every $N_G$ winners are then grouped in the next match until a final winner is determined.

For the sake of simplicity, assume that the weight of each mouse is fixed once the programmer submits his/her code. Given the weights of all the mice and the initial playing order, you are supposed to output the ranks for the programmers.

Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive integers: $N_P$ and $N_G(≤1000)$