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

#include <bits/stdc++.h>

// Gaurav Khairnar 2020
// codechef   : gaurav_1620
// codeforces : gaurav1620
// email      : gauravak007@gmail.com
// Linedin    : https://www.linkedin.com/in/gaurav-khairnar-393100171/
// Github     : www.github.com/gaurav1620
//
#define Ninja                                                                  \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(NULL);
#define fo(i, n) for (i = 0; i < n; i++)
#define rfo(i, n) for (i = n - 1; n >= 0; i++ 0)
#define rep(i, l, r) for (i = l; i <= r; i++)
#define reprev(i, r, l) for (i = r; i >= l; i--)
#define ll long long

#define vl vector<ll>
#define vll vector<vector<ll>>
#define vpll vector<pair<ll, ll>>

#define pll pair<ll, ll>
#define plpll pair<ll, pair<ll, ll>>
#define pllpl pair<pair<ll, ll>, ll>

#define pb push_back

#define watch(x) cerr << (#x) << " is : " << (x) << endl

// Removes cerr on judging platforms
#ifdef ONLINE_JUDGE
#define cerr                                                                   \\
  if (false)                                                                   \\
  cerr
#endif

using namespace std;

// Generic
template <typename T> void deb(T v[], ll n) {
  cerr << "ARRAY   : ";
  ll i;
  fo(i, n) cerr << v[i] << " ";
  cerr << endl;
}
template <typename T> void deb(set<T> s) {
  cerr << "SET     : ";
  for (auto it : s)
    cerr << it << " ";
  cerr << endl;
}
template <typename T> void deb(vector<T> v) {
  cerr << "VECTOR : ";
  ll i;
  fo(i, v.size()) cerr << v[i] << " ";
  cerr << endl;
}
template <typename T> void deb(stack<T> s) {
  cerr << "STACK   : ";
  stack<T> st = s;
  while (st.size()) {
    cerr << st.top() << " ";
    st.pop();
  };
  cerr << endl;
}
template <typename T> void deb(queue<T> q) {
  cerr << "Queue   : ";
  queue<T> qq = q;
  while (qq.size()) {
    cerr << qq.front() << " ";
    qq.pop();
  };
  cerr << endl;
}

// Not generic
void deb(map<ll, ll> m) {
  cerr << "MAP : ";
  for (auto it : m)
    cerr << it.first << " : " << it.second << endl;
}
void deb(unordered_map<ll, ll> m) {
  cerr << "MAP : ";
  for (auto it : m)
    cerr << it.first << " : " << it.second << endl;
}

template <typename T> T abs(T a) { return a < 0 ? a * -1 : a; }

// Functions
void swap(ll &x, ll &y);
bool isPrime(ll n);
ll nCrModp(ll n, ll r, ll p);
ll power(ll x, ll y, ll p);
ll gcdExtended(ll a, ll b, ll *x, ll *y);
ll modInverse(ll b, ll m);
ll modDivide(ll a, ll b, ll m);

// Sieves
void simpleSieve(ll N, bool[]);
void PrimeDivisorSieve(ll N, ll prime[]);

/*
 * For fast comments
 */

ll testCases;
#define yess cout << "YES\\n";
#define noo cout << "NO\\n";

int main() {
  Ninja
      // ▬▬ι═══════>

      testCases = 1;
  while (testCases--) {
    // roll
    ll n;
    cin >> n;
    ll m;
    cin >> m;
    ll arr[n];
    ll i, j, k;
    fo(i, n) cin >> arr[i];
    sort(arr, arr + n);
    ll tot = 0;
    fo(i, n) tot += arr[i];

    ll gg = tot / (4 * m);
    if (arr[n - m] * 4 * m >= tot)
      cout << "Yes\\n";
    else
      cout << "No\\n";
  }

  // ▬▬ι═══════>
  return 0;
}

// Example :
//  If we want primes till 1043
//  N = 1043
//  prime[N+1];
//  sieve(N,prime);
void simpleSieve(ll N, bool prime[]) {

  ll i, j;
  fo(i, N + 1) prime[i] = true;
  for (i = 2; i * i <= N; i++) {
    if (prime[i]) {
      for (j = i * i; j <= N; j++) {
        prime[j] = false;
      }
    }
  }
}

// Example :
//  If we want primes till 1043
//  N = 1043
//  prime[N+1];
//  sieve(N,prime);
void PrimeDivisorSieve(ll N, ll prime[]) {
  ll i, j;

  fo(i, N + 1) prime[i] = i;

  // stores the minimum Prime divisor
  for (i = 2; i * i <= N; i++) {
    if (prime[i] == i) {
      for (j = i; j <= N; j++) {
        if (prime[j] == j)
          prime[j] = i;
      }
    }
  }
}
void swap(ll &x, ll &y) {
  x ^= y;
  y ^= x;
  x ^= y;
}
bool isPrime(ll n) {
  if (n <= 1)
    return false;
  for (ll i = 2; i < n; i++)
    if (n % i == 0)
      return false;
  return true;
}

ll nCrModp(ll n, ll r, ll p) {
  ll C[r + 1];
  memset(C, 0, sizeof(C));
  C[0] = 1;
  for (ll i = 1; i <= n; i++) {
    for (ll j = min(i, r); j > 0; j--)
      C[j] = (C[j] + C[j - 1]) % p;
  }
  return C[r];
}

ll power(ll x, ll y, ll p) {
  ll res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1)
      res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}

// Used for modInverse
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  ll x1, y1;
  ll gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;

  return gcd;
}

// Used for modDivide
ll modInverse(ll b, ll m) {
  ll x, y;
  ll g = gcdExtended(b, m, &x, &y);
  if (g != 1)
    return -1;
  return (x % m + m) % m;
}

// Use this for modular divisions
ll modDivide(ll a, ll b, ll m) {
  a = a % m;
  ll inv = modInverse(b, m);
  if (inv == -1)
    return -1;
  else
    return (inv * a) % m;
}

/*
  ____   ___  ____     __  __     __     _____   _     ____ __    ___
 |  _ \\ / _ \\|  _ \\   |  \\/  |   /  \\   |  _  \\ | |   |  __\\  \\  /  /
 | |_) | | | | |_) |  | \\  / |  / ^  \\  | |_)  || |   | |_  \\  \\/  /
 |  _ <| | | |  _ <   | |\\/| | / /_\\  \\ |     / | |   |  _|  \\    /
 | |_) | `-' | |_) |  | |  | |/ _____  \\| |\\  '-| `---| |___  |  |
 |____/ \\___/|____/   |_|  |_|_/     \\__|_| `.__|_____|_____| |__|
    ,         |                                     |            '
    |         .                                     ;            |
    ;          \\                                   .            ;
     ;          .                                 /            /
      \\          \\    .-""-._           _.--""-. /            /
       \\          ','`       r'-.  _.-'\\        t           .'
        `.        '          \\__/`| |__/                  .'
          '.                _..._7\\    _,_             .'
            `'Y          ,'`     `/`"'`   `.         ,'
             /          /                   ;        L
            ;           |                   |         |mx
            |           ;                  ;          ;
             ; _ __      \\                /     _ .- /
              \\  \\ \\ `.   `.            .'    / ' / /
               '._\\ `. \\    `.        .'    .' / /-'
                   `._\\ `.    `.    .' .-..'_.'-`
                       `-'`. /`.`. /  /  /
                            `\\ _> )|  \\_/
                             `'-'  `--'
*/

Error: 0

Fixed submission:

#include <bits/stdc++.h>

// Gaurav Khairnar 2020
// codechef   : gaurav_1620
// codeforces : gaurav1620
// email      : gauravak007@gmail.com
// Linedin    : https://www.linkedin.com/in/gaurav-khairnar-393100171/
// Github     : www.github.com/gaurav1620
//
#define Ninja                                                                  \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(NULL);
#define fo(i, n) for (i = 0; i < n; i++)
#define rfo(i, n) for (i = n - 1; n >= 0; i++ 0)
#define rep(i, l, r) for (i = l; i <= r; i++)
#define reprev(i, r, l) for (i = r; i >= l; i--)
#define ll long long

#define vl vector<ll>
#define vll vector<vector<ll>>
#define vpll vector<pair<ll, ll>>

#define pll pair<ll, ll>
#define plpll pair<ll, pair<ll, ll>>
#define pllpl pair<pair<ll, ll>, ll>

#define pb push_back

#define watch(x) cerr << (#x) << " is : " << (x) << endl

// Removes cerr on judging platforms
#ifdef ONLINE_JUDGE
#define cerr                                                                   \\
  if (false)                                                                   \\
  cerr
#endif

using namespace std;

// Generic
template <typename T> void deb(T v[], ll n) {
  cerr << "ARRAY   : ";
  ll i;
  fo(i, n) cerr << v[i] << " ";
  cerr << endl;
}
template <typename T> void deb(set<T> s) {
  cerr << "SET     : ";
  for (auto it : s)
    cerr << it << " ";
  cerr << endl;
}
template <typename T> void deb(vector<T> v) {
  cerr << "VECTOR : ";
  ll i;
  fo(i, v.size()) cerr << v[i] << " ";
  cerr << endl;
}
template <typename T> void deb(stack<T> s) {
  cerr << "STACK   : ";
  stack<T> st = s;
  while (st.size()) {
    cerr << st.top() << " ";
    st.pop();
  };
  cerr << endl;
}
template <typename T> void deb(queue<T> q) {
  cerr << "Queue   : ";
  queue<T> qq = q;
  while (qq.size()) {
    cerr << qq.front() << " ";
    qq.pop();
  };
  cerr << endl;
}

// Not generic
void deb(map<ll, ll> m) {
  cerr << "MAP : ";
  for (auto it : m)
    cerr << it.first << " : " << it.second << endl;
}
void deb(unordered_map<ll, ll> m) {
  cerr << "MAP : ";
  for (auto it : m)
    cerr << it.first << " : " << it.second << endl;
}

template <typename T> T abs(T a) { return a < 0 ? a * -1 : a; }

// Functions
void swap(ll &x, ll &y);
bool isPrime(ll n);
ll nCrModp(ll n, ll r, ll p);
ll power(ll x, ll y, ll p);
ll gcdExtended(ll a, ll b, ll *x, ll *y);
ll modInverse(ll b, ll m);
ll modDivide(ll a, ll b, ll m);

// Sieves
void simpleSieve(ll N, bool[]);
void PrimeDivisorSieve(ll N, ll prime[]);

/*
 * For fast comments
 */

ll testCases;
#define yess cout << "YES\\n";
#define noo cout << "NO\\n";

int main() {
  Ninja
      // ▬▬ι═══════>

      testCases = 1;
  while (testCases--) {
    // roll
    ll n;
    cin >> n;
    ll m;
    cin >> m;
    ll arr[m];
    ll i, j, k;
    fo(i, n) cin >> arr[i];
    sort(arr, arr + n);
    ll tot = 0;
    fo(i, n) tot += arr[i];

    ll gg = tot / (4 * m);
    if (arr[n - m] >= gg)
      cout << "Yes\\n";
    else
      cout << "No\\n";
  }

  // ▬▬ι═══════>
  return 0;
}

// Example :
//  If we want primes till 1043
//  N = 1043
//  prime[N+1];
//  sieve(N,prime);
void simpleSieve(ll N, bool prime[]) {

  ll i, j;
  fo(i, N + 1) prime[i] = true;
  for (i = 2; i * i <= N; i++) {
    if (prime[i]) {
      for (j = i * i; j <= N; j++) {
        prime[j] = false;
      }
    }
  }
}

// Example :
//  If we want primes till 1043
//  N = 1043
//  prime[N+1];
//  sieve(N,prime);
void PrimeDivisorSieve(ll N, ll prime[]) {
  ll i, j;

  fo(i, N + 1) prime[i] = i;

  // stores the minimum Prime divisor
  for (i = 2; i * i <= N; i++) {
    if (prime[i] == i) {
      for (j = i; j <= N; j++) {
        if (prime[j] == j)
          prime[j] = i;
      }
    }
  }
}
void swap(ll &x, ll &y) {
  x ^= y;
  y ^= x;
  x ^= y;
}
bool isPrime(ll n) {
  if (n <= 1)
    return false;
  for (ll i = 2; i < n; i++)
    if (n % i == 0)
      return false;
  return true;
}

ll nCrModp(ll n, ll r, ll p) {
  ll C[r + 1];
  memset(C, 0, sizeof(C));
  C[0] = 1;
  for (ll i = 1; i <= n; i++) {
    for (ll j = min(i, r); j > 0; j--)
      C[j] = (C[j] + C[j - 1]) % p;
  }
  return C[r];
}

ll power(ll x, ll y, ll p) {
  ll res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1)
      res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}

// Used for modInverse
ll gcdExtended(ll a, ll b, ll *x, ll *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  ll x1, y1;
  ll gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;

  return gcd;
}

// Used for modDivide
ll modInverse(ll b, ll m) {
  ll x, y;
  ll g = gcdExtended(b, m, &x, &y);
  if (g != 1)
    return -1;
  return (x % m + m) % m;
}

// Use this for modular divisions
ll modDivide(ll a, ll b, ll m) {
  a = a % m;
  ll inv = modInverse(b, m);
  if (inv == -1)
    return -1;
  else
    return (inv * a) % m;
}

/*
  ____   ___  ____     __  __     __     _____   _     ____ __    ___
 |  _ \\ / _ \\|  _ \\   |  \\/  |   /  \\   |  _  \\ | |   |  __\\  \\  /  /
 | |_) | | | | |_) |  | \\  / |  / ^  \\  | |_)  || |   | |_  \\  \\/  /
 |  _ <| | | |  _ <   | |\\/| | / /_\\  \\ |     / | |   |  _|  \\    /
 | |_) | `-' | |_) |  | |  | |/ _____  \\| |\\  '-| `---| |___  |  |
 |____/ \\___/|____/   |_|  |_|_/     \\__|_| `.__|_____|_____| |__|
    ,         |                                     |            '
    |         .                                     ;            |
    ;          \\                                   .            ;
     ;          .                                 /            /
      \\          \\    .-""-._           _.--""-. /            /
       \\          ','`       r'-.  _.-'\\        t           .'
        `.        '          \\__/`| |__/                  .'
          '.                _..._7\\    _,_             .'
            `'Y          ,'`     `/`"'`   `.         ,'
             /          /                   ;        L
            ;           |                   |         |mx
            |           ;                  ;          ;
             ; _ __      \\                /     _ .- /
              \\  \\ \\ `.   `.            .'    / ' / /
               '._\\ `. \\    `.        .'    .' / /-'
                   `._\\ `.    `.    .' .-..'_.'-`
                       `-'`. /`.`. /  /  /
                            `\\ _> )|  \\_/
                             `'-'  `--'
*/