1056. Mice and Rice (25)

他喵的，输入第三行老是理解错误

#define  _CRT_SECURE_NO_WARNINGS 
#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<stdio.h> 
using namespace std; 


int main()
{ 
int N, M;
cin >> N >> M;
int *mouse = new int[N];
int *mouse_rank = new int[N];
for (int i = 0; i < N; i++)
scanf("%d",&mouse[i]);


vector<int> rank;

for (int i = 0; i < N; i++)
{
int tmp;
scanf("%d",&tmp);
rank.push_back(tmp);
}
 
int K = N,grad; 
while (rank.size()>1)
{ 
if (K%M == 0)
grad = K / M + 1;
else
grad = K / M + 2;
vector<int> rank_tmp;
for (int i = 0; i < rank.size();)
{ 
int max = mouse[rank[i]], mark = i;
for (int j = 0; j < M&&i + j<rank.size(); j++)
{
if (mouse[rank[i + j]] > max)
{
max = mouse[rank[i + j]];
mark = i + j;
}
}
for (int j = 0; j < M&&i + j<rank.size(); j++)
{
if (mark == i + j)
{
rank_tmp.push_back(rank[mark]);
}
else
{
mouse_rank[rank[i + j]] = grad; 
}
}
i += M;
}
if (K%M == 0)
K = K / M ;
else
K = K / M +1;
rank = rank_tmp;
}
mouse_rank[rank[0]] = 1;
 
cout << mouse_rank[0];
for (int i = 1; i < N; i++)
{
cout << " " << mouse_rank[i];// << irank[mouse_rank[i]];
}
return 0;
}