This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define N 100005
int n, mh;
long long s, cnt[N], cnt1[N], ans, avr;
pair <int, int> mast[N];
int main (){
cin >> n;
for (int i = 0;i < n;i++){
cin >> mast[i].first>> mast[i].second;
s += mast[i].second;
mh = max(mh, mast[i].first);
cnt[mast[i].first]++;
cnt[mast[i].first - mast[i].second]--;
}
for (int i = mh;i > 0;i--) cnt[i] += cnt[i + 1];
for (int i = mh;i > 0;i--){
avr = min(s / i, cnt[i]);
cnt[i - 1] += cnt[i] - avr;
cnt[i] = avr;
s -= avr;
}
for (int i = 1;i <= mh;i++)
ans += cnt[i] * (cnt[i] - 1) / 2;
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |