Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- typedef long long int lld;
- lld n,d;
- vector<lld>co;
- int main(){
- scanf("%lld %lld",&n,&d);
- for(lld i=0;i<n;i++){
- lld a; scanf("%lld",&a);
- co.push_back(a);
- }
- sort(co.begin(),co.end());
- vector<lld> sum(n,0);
- lld f=0;
- for(int i=1;i<n;i++){
- while(f<=i){
- if(co[f]+d>=co[i]){
- sum[i]=sum[i-1]+i-f; break;
- }
- f++;
- }
- }
- printf("%lld",sum[n-1]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement