经过我的测试,上一期的切葱排序依然有问题,所以,我改了一下。
#include <bits/stdc++.h>
using namespace std;
long long n,a[10001],b[10001],x[10001],mmax=-100,minn=19000000000;
void check(){
for(int i=0;i<n;i++){
if(a[i]<=0&&x[i]!=-1) x[i]=-1,cerr<<b[i]<<" ";
else minn=min(b[i],minn);
}
}
bool checkr(){
for(int i=0;i<n;i++) if(a[i]>0) return 0;
return 1;
}
int main(){
cin>>n;
for(int i=0;i<n;i++)cin>>b[i],a[i]=b[i],minn=min(minn,a[i]);
while(!checkr()){
minn=19000000000;
check();
if(minn==19000000000) minn=1;
for(int i=0;i<n;i++)
if(x[i]!=-1) a[i]-=minn;
}
check();
}