Problem p03038 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#include <cmath>
#include <math.h>

using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;

#define rep(i, n)                                                              \
  ;                                                                            \
  for (int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define f(i, a, b) for (int i = a; i < b; i++)
#define pri(a) printf("%.14lf\n", a);
#define MOD 1000000007
bool is_int_lround(double x) { return std::lround(x) == x; }
ll keta(ll x) {
  ll n = 0;
  while (x > 0) {
    x /= 10;
    n++;
  }
  return n;
}

ll conbi(int n, int m) {

  cin >> n >> m;
  vector<ll> a(100);
  a[0] = 1;
  for (int i = 0; i < 14; i++) {
    a[i + 1] = a[i] * (i + 1);
  }
  return a[n] / (a[m] * a[n - m]);
}

long long modpow(long long a, long long n, long long mod) {
  long long res = 1; // 繰り返し二乗法
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
ll kaijo(ll x) {
  ll z = 1;
  while (x > 0) {
    z *= x;
    z %= MOD;
    x--;
  }
  return z;
}
ll yakusu_num(ll n) {
  vl yakusu(n + 1, 1);
  for (ll i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      n /= i;
      yakusu[i]++;
    }
  }
  if (n != 1)
    yakusu[n]++;
  ll num = 1;
  for (ll i = 0; i <= n; i++) {
    num *= yakusu[i];
  }
  return num;
}

int main() {
  ll N, M;
  cin >> N >> M;
  vl a(N);
  vl b(N);
  vl c(N);
  vector<pair<ll, ll>> p(M);
  rep(i, N) { cin >> a[i]; }
  rep(i, M) {
    cin >> b[i] >> c[i];
    p[i] = make_pair(c[i], b[i]);
  }
  sort(all(a));
  sort(all(p));
  reverse(all(p));
  int j = 0;
  ll ans = 0;
  rep(i, M) {
    int k = 0;
    while (p[i].second > k && j < N) {
      a[j] = max(a[j], p[i].first);
      j++;
      k++;
    }
  }
  rep(i, N) ans += a[i];
  cout << ans << endl;
}

Fixed submission:
#include <bits/stdc++.h>
#include <cmath>
#include <math.h>

using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;

#define rep(i, n)                                                              \
  ;                                                                            \
  for (int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define f(i, a, b) for (int i = a; i < b; i++)
#define pri(a) printf("%.14lf\n", a);
#define MOD 1000000007
bool is_int_lround(double x) { return std::lround(x) == x; }
ll keta(ll x) {
  ll n = 0;
  while (x > 0) {
    x /= 10;
    n++;
  }
  return n;
}

ll conbi(int n, int m) {

  cin >> n >> m;
  vector<ll> a(100);
  a[0] = 1;
  for (int i = 0; i < 14; i++) {
    a[i + 1] = a[i] * (i + 1);
  }
  return a[n] / (a[m] * a[n - m]);
}

long long modpow(long long a, long long n, long long mod) {
  long long res = 1; // 繰り返し二乗法
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
ll kaijo(ll x) {
  ll z = 1;
  while (x > 0) {
    z *= x;
    z %= MOD;
    x--;
  }
  return z;
}
ll yakusu_num(ll n) {
  vl yakusu(n + 1, 1);
  for (ll i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      n /= i;
      yakusu[i]++;
    }
  }
  if (n != 1)
    yakusu[n]++;
  ll num = 1;
  for (ll i = 0; i <= n; i++) {
    num *= yakusu[i];
  }
  return num;
}

int main() {
  ll N, M;
  cin >> N >> M;
  vl a(N);
  vl b(M);
  vl c(M);
  vector<pair<ll, ll>> p(M);
  rep(i, N) { cin >> a[i]; }
  rep(i, M) {
    cin >> b[i] >> c[i];
    p[i] = make_pair(c[i], b[i]);
  }
  sort(all(a));
  sort(all(p));
  reverse(all(p));
  int j = 0;
  ll ans = 0;
  rep(i, M) {
    int k = 0;
    while (p[i].second > k && j < N) {
      a[j] = max(a[j], p[i].first);
      j++;
      k++;
    }
  }
  rep(i, N) ans += a[i];
  cout << ans << endl;
}