Problem p03038 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#define rep(i, m, n) for (int i = int(m); i < int(n); i++)
#define all(c) begin(c), end(c)

template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
  if (a > b)
    a = b;
}

template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
  if (a < b)
    a = b;
}

// 改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 // デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007

// ここから編集する
class Solve {
public:
  void input() {}

  void solve() {
    input();
    int N, M;
    cin >> N >> M;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];

    vector<pair<ll, ll>> cb(M);
    rep(i, 0, M) { cin >> cb[i].second >> cb[i].first; }

    sort(all(cb));
    reverse(all(cb));

    vector<ll> D;
    int idx = 0;
    while (D.size() < A.size() && idx < cb.size()) {
      ll val = cb[idx].first;
      ll cnt = cb[idx].second;
      for (ll i = 0; i < cnt && D.size() < A.size(); ++i) {
        D.push_back(val);
      }
      idx++;
    }

    sort(all(A));
    ll ans = 0ll;
    for (int i = 0; i < N; ++i) {
      ans += max(A[i], D[i]);
    }
    cout << ans << endl;
  }
};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);

  Solve().solve();

  return 0;
}


Fixed submission:
#include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#define rep(i, m, n) for (int i = int(m); i < int(n); i++)
#define all(c) begin(c), end(c)

template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
  if (a > b)
    a = b;
}

template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
  if (a < b)
    a = b;
}

// 改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 // デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007

// ここから編集する
class Solve {
public:
  void input() {}

  void solve() {
    input();
    int N, M;
    cin >> N >> M;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];

    vector<pair<ll, ll>> cb(M);
    rep(i, 0, M) { cin >> cb[i].second >> cb[i].first; }

    sort(all(cb));
    reverse(all(cb));

    vector<ll> D;
    int idx = 0;
    while (D.size() < A.size() && idx < cb.size()) {
      ll val = cb[idx].first;
      ll cnt = cb[idx].second;
      for (ll i = 0; i < cnt && D.size() < A.size(); ++i) {
        D.push_back(val);
      }
      idx++;
    }

    while (D.size() < A.size()) {
      D.push_back(0);
    }

    sort(all(A));
    ll ans = 0ll;
    for (int i = 0; i < N; ++i) {
      ans += max(A[i], D[i]);
    }
    cout << ans << endl;
  }
};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);

  Solve().solve();

  return 0;
}