#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
int team[100],n;
bool isfull[100]={false};
vector<int> school[100];
cin>>n;
for(int i=0;i<n;i++)
{
cin>>team[i];
team[i]*=10;
}
int num=1;
int pos=1;
while(num<=n)
{
for(int i=0;i<n;i++)
{
if(school[i].size()<team[i])
{
school[i].push_back(pos);
if(num<n)
{
pos++;
printf("p1=%d ",pos);
}
else
{
pos+=2;
printf("p2=%d ",pos);
}
}
if(school[i].size()==team[i]&&!isfull[i])
{
isfull[i]=true;
num++;
}
}
}
for(int i=0;i<n;i++)
{
cout<<'#'<<i+1<<endl;
for(int j=0;j<school[i].size();j++)
{
cout<<school[i][j];
if(j&&(j+1)%10==0)
cout<<endl;
else
cout<<' ';
}
}
return 0;
}
天梯赛座位分配
最新推荐文章于 2023-03-04 23:47:31 发布