数据结构顺序表写猴子选大王怎么写啊？

#include "stdio.h"
#include "malloc.h"

int SelectKing(int n, int m) {
int i, current, count, *monkey, in = 1, out = 0;
monkey = (int*) malloc (sizeof(int) * (n + 1));
for(i = 1; i <= n; i++) monkey[i] = in;
for(i = 1, current = 1; i < n; i++) {
count = 0;
if(monkey[current] == in) count++;
while(count < m){
current = current % n + 1;
if(monkey[current] == in) count++;
}
monkey[current] = out;
}
for(current = 1; current <= n; current++)
if(monkey[current] == in) break;
return current;
}
void main( ){
int n, m king;
printf("请输入猴子的个数: ");
scanf("%d", &n);
printf("请输入要报的数: ");
scanf("%d", &m);
king = SelectKing(n, m);
printf("%d号猴子是大王\n", king);
}