Problem p02598 (C++) — buggy submission, verdict: Runtime Error

#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 1000000000
#define INF 3223372036854775807
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo - r(ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
// #define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n, k) ((n >> k) & 1)
// #define leng length()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> Pin;
typedef pair<ll, ll> Pll;
template <class T> using V = vector<T>;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
ll pom(ll a, ll n, int m) {
  ll x = 1;
  for (a %= m; n; n /= 2)
    n & 1 ? x = x * a % m : 0, a = a * a % m;
  return x;
}
#define invp(a, p) pom(a, p - 2, p)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
ll cmp1(pair<Pll, ll> a, pair<Pll, ll> b) { return a.fi.se > b.fi.se; }
ll cmp2(pair<Pll, ll> a, pair<Pll, ll> b) { return a.se < b.se; }
//----------------------------------------------------------------------

//----------------------------------------------------------------------
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  //-------------------------------
  // ll begin_t=clock();
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
  //------------------------------
  ll n, k;
  cin >> n >> k;
  V<ll> a(n);
  for (ll i = 0; i < n; i++)
    cin >> a[i];
  double l = 0, r = 1000000000;
  while (r - l > 0.00001) {
    // cout<<l<<" "<<r<<endl;
    double mid = (l + r) / 2.0;
    bool abc = 1;
    ll cnt = 0;
    for (ll i = 0; i < n; i++) {
      ll x = (ll)floor((double)a[i] / mid);
      // if((double)(x+1)*mid<a[i])x++;
      // if((double)x*mid>=a[i])x--;
      cnt += x;
    }
    // cout<<cnt<<" "<<k<<endl;
    if (cnt > k)
      abc = 0;
    if (abc == 1) {
      r = mid;
    } else
      l = mid;
    // cout<<endl;
  }
  // printf("%.10lf\\n",l);

  ll cnt = 0;
  l = floor(r);
  // printf("%.10lf\\n",l);
  if (l > 0) {
    for (ll i = 0; i < n; i++) {
      ll x = (ll)floor((double)a[i] / l);
      if (a[i] % (ll)l == 0)
        x--;
      cnt += x;
    }

    if (cnt <= k) {
      r = l;
    }
  }
  // printf("%.10lf\\n",r);
  cout << (ll)ceil(r) << endl;
  //------------------------------
  // fclose(stdin);
  // fclose(stdout);
  // ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
  //-------------------------------
  return 0;
}
//----------------------------------------------------------------------


Error: 0

Fixed submission:

#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 1000000000
#define INF 3223372036854775807
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo - r(ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
// #define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n, k) ((n >> k) & 1)
// #define leng length()
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> Pin;
typedef pair<ll, ll> Pll;
template <class T> using V = vector<T>;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
ll pom(ll a, ll n, int m) {
  ll x = 1;
  for (a %= m; n; n /= 2)
    n & 1 ? x = x * a % m : 0, a = a * a % m;
  return x;
}
#define invp(a, p) pom(a, p - 2, p)
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
ll cmp1(pair<Pll, ll> a, pair<Pll, ll> b) { return a.fi.se > b.fi.se; }
ll cmp2(pair<Pll, ll> a, pair<Pll, ll> b) { return a.se < b.se; }
//----------------------------------------------------------------------

//----------------------------------------------------------------------
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  //-------------------------------
  // ll begin_t=clock();
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
  //------------------------------
  ll n, k;
  cin >> n >> k;
  V<ll> a(n);
  for (ll i = 0; i < n; i++)
    cin >> a[i];
  double l = 0, r = 1000000000;
  while (r - l > 0.00001) {
    // cout<<l<<" "<<r<<endl;
    double mid = (l + r) / 2.0;
    bool abc = 1;
    ll cnt = 0;
    for (ll i = 0; i < n; i++) {
      ll x = (ll)floor((double)a[i] / mid);
      // if((double)(x+1)*mid<a[i])x++;
      // if((double)x*mid>=a[i])x--;
      cnt += x;
    }
    // cout<<cnt<<" "<<k<<endl;
    if (cnt > k)
      abc = 0;
    if (abc == 1) {
      r = mid;
    } else
      l = mid;
    // cout<<endl;
  }
  // printf("%.10lf\\n",l);

  ll cnt = 0;
  l = floor(r);
  // printf("%.10lf\\n",l);
  for (ll i = 0; i < n; i++) {
    ll x = (ll)floor((double)a[i] / l);
    if (a[i] % (ll)l == 0)
      x--;
    // printf("%.10f\\n",(double)a[i]/l);
    // if((double)(x+1)*mid<a[i])x++;
    // if((double)x*mid>=a[i])x--;
    // cout<<x<<endl;
    cnt += x;
  }

  if (cnt <= k) {
    r = l;
  }

  // printf("%.10lf\\n",r);
  cout << (ll)ceil(r) << endl;
  //------------------------------
  // fclose(stdin);
  // fclose(stdout);
  // ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
  //-------------------------------
  return 0;
}
//----------------------------------------------------------------------