Submission #33496977

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

#define mp make_pair
#define pb push_back
#define ll long long

//#define debug(x) ;
#define debug(x) cerr << #x << " = " << x << "\n";

ostream& operator<<(ostream& cerr, vector<ll> aux) {
  cerr << "[";
  for (auto e : aux) cerr << e << ' ';
  cerr << "]";
  return cerr;
}

const int maxN = 300011;

ll n, a, b;
ll v[maxN];

bool check(ll limit) {
  ll to_add = 0;
  ll to_rm = 0;

  for (int i = 0; i < n; i++) {
    ll x = v[i];

    if (x < limit) {
      to_add += (limit - x + a - 1) / a;
    }

    if (x > limit) {
      to_rm += (x - limit) / b;
    }
  }

  return to_add <= to_rm;
}

int main()
{

  cin >> n >> a >> b;
  for (int i = 0; i < n; i++) 
    cin >> v[i];

  ll low = 0;
  ll high = 1e9 + 1;

  for (ll step = 1 << 30; step > 0; step >>= 1) 
    if (low + step < high) 
      if (check(low + step))
        low += step;

  cout << low;


  return 0;
}

Submission Info

Judge Result