Submission #1865299

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define pb push_back
using namespace std;
const int INF = 1e9;
typedef long long ll;

int main(){
  ll n,a,b;
  cin >> n >> a >> b;
  vector <ll> h;
  REP(i,n){
    ll c;
    cin >> c;
    h.pb(c);
  }
  ll num = 0;
  sort(h.begin(),h.end(),greater<ll>());
  while(1){
    h[0] -= a;
    for(int i = 1;i < h.size();i++){
      h[i] -= b;
    }
    if(h[0] <= h[1])
      sort(h.begin(),h.end(),greater<ll>());
    num++;
    if(h[0] <= 0)
      break;
  }
  cout << num << endl;
  return 0;
}

Submission Info

Judge Result