这题建议用优先队列,队首就是最大值
复杂度:O(logn)
```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
// 洛谷P1843
priority_queue<int> q;
int n,a,b,t;
cin>>n>>a>>b;
for(int i=1;i<=n;i++){
cin>>t;
q.push(t);
}
t=0;
while(q.top()-t*a>0){
int h=q.top();
q.pop();
q.push(h-b);
t++;
}
cout<<t;
return 0;
}
```
by Ethan216 @ 2023-12-02 09:54:28