Submission #1331602

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef pair <ll,ll> P;
int N;
vector<P> a;

int main() {
  cin >> N;

  for(int i = 0; i < N; i++) {
    ll A, B;
    cin >> A >> B;
    a.push_back(P(A,B));
  }

  sort(a.begin(), a.end(), greater<P> ());

  ll ans = 0;
  ll k = 0;

  for(int i = 0; i < a.size(); i++) {
    ll tmp = a[i].first + k; ll tmp2 = 0;
    if(tmp / a[i].second == 0) {
      ans += a[i].second - tmp;
      k += a[i].second - tmp;
    }
    else {
      if(tmp % a[i].second != 0) tmp2++; 
      tmp2 += tmp / a[i].second;
      ans += tmp2 * a[i].second - tmp;
      k += tmp2 * a[i].second - tmp;
    }
   
  
  }

  cout << ans <<endl;
}
   
  

Submission Info

Judge Result