Submission #75972341

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define pb push_back

template<class T> inline bool chmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template<class T> inline bool chmin(T& a, T b) { return a > b ? a = b, 1 : 0; }

const int MOD = 1e9 + 7;

void solve() {
    
    int n,d;cin>>n>>d;
    vector<pair<ll,ll>> a(n)    ;
    for(int i=0;i<n;i++){
        cin>>a[i].first>>a[i].second;
    }
    sort(all(a));
    ll ans=0;
    ll currsum=0;
    int l=0;
    for(int r=0;r<n;r++){
        while(l<r&&(a[r].first-a[l].first)>d){
            currsum-=a[l].second;
            l++;
        }
        ans+=currsum*a[r].second;
        currsum+=a[r].second;
    }
    cout<<ans<<'\n';
    
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tt = 1;
    //cin >> tt;

    while (tt--) {
        solve();
    }

    return 0;
}

Submission Info

Judge Result