Submission #1865340

---

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){
    ll s = a-b;
    ll t = h[0]-h[1];
    ll g = t/s;
    /*if(g > 0){
      h[0] -= a*g;
      h[1] -= b*g;
      num += g;
    }
    else{
      h[0] -= a;
      h[1] -= b;
      if(h[0] < h[1])
	swap(h[0],h[1]);
      num++;
      }*/
    h[0] -= a;
    h[1] -= b;
    if(h[0] < h[1])
      swap(h[0], h[1]);
    num++;
    if(h[0] <= 0)
      break;
  }
  cout << num << endl;
  return 0;
}

Submission Info

Judge Result