Submission #4074937

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second

/* clang-format off */
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
template <class T> inline void chmin(T &a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T &a, const T& b) { if (b > a) a = b; }
/* clang-format on */

using P = pair<ll, ll>;

int main() {
  int N, K;
  while (cin >> N >> K) {
    vector<ll> a(N), b(N);
    for (int i = 0; i < N; i++) cin >> a[i] >> b[i];
    priority_queue<P, vector<P>, greater<P>> pq;
    for (int i = 0; i < N; i++) {
      pq.emplace(a[i], b[i]);
    }
    ll res = 0;
    for (int t = 0; t < K; t++) {
      P p = pq.top();
      pq.pop();
      res += p.fst;
      pq.emplace(p.fst + p.snd, p.snd);
    }
    cout << res << endl;
  }
  return 0;
}

Submission Info

Judge Result