A1056 Mice and Rice (25 分)

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int np;//the number of programmers
int ng;//the maximum number of mice in a group
int Mouse_W[1010] ;//the weight of the i-th mouse respectively
int programmer[maxn];//a permutation of 0,⋯,N

struct Mouse
{
    int weight;
    int order=0;
}MouseList[maxn];


queue<int> q;
int main()
{
    //11 3
    scanf("%d%d",&np,&ng);
    //25 18 0 46 37 3 19 22 57 56 10
    for(int i=0;i<np;i++)
    {
        scanf("%d",&MouseList[i].weight);
    }
    //6 0 8 7 10 5 9 1 4 2 3
    for(int i=0;i<np;i++)
    {
        int temp;
        scanf("%d",&temp);
        q.push(temp);
    }
    int temp = np;
    while(q.size() != 1)
    {
        //确定这一次的分组
        int group=0;
        if(q.size() % ng == 0)
            group = temp/ng;
        else
            group = temp/ng + 1;
        //循环一轮
        for(int i=0;i<group;i++)
        {
            int max = q.front();
            for(int j=0;j<ng;j++)
            {
                if(i*ng+j >= temp)
                    break;
                int current = q.front();
                if(MouseList[max].weight < MouseList[current].weight)
                    max = current;
                MouseList[current].order = group+1;
                q.pop();
            }
            q.push(max);
        }
        temp = group;
    }

    MouseList[q.front()].order = 1;
    for(int i=0;i<np;i++)
    {
        printf("%d",MouseList[i].order);
        if(i!=np-1)
            printf(" ");
        else
            printf("\n");
    }
    
    return 0;
}