题解为#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
struct node{
int id,t;
};
queue<node> q;
int a[100005],n,k,ans;
bool cmp(int a,int b){
return a>b;
}
int main(){
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>a[i];
q.push({i,a[i]});
}
sort(a,a+n,cmp);
int i=0;
while(q.size()){
node b=q.front();
q.pop();
if(b.ta[i]){
ans++;
i++;
if(b.idk){
cout<<ans;
break;
}
}else{
q.push(b);
}
}
return 0;
}
