Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- using namespace std;
- int myvector[100000];
- int main()
- {
- long long n, m;
- cin>>n>>m;
- long long k=0;
- for(int i=0;i<n;i++)
- {
- cin>>myvector[i];
- }
- std::vector<int> niza (myvector, myvector+n);
- std::sort (niza.begin(), niza.end());
- for(int i=0;i<n;i++)
- {
- if(niza[n-1]-niza[0]<m)
- {
- break;
- }
- if(niza[n-1]==niza[0]&&m==0)
- {
- k=(n*(n-1))/2;
- break;
- }
- for(int j=i+1;j<n;j++)
- {
- if(niza[i]==niza[j]-m)
- {
- k++;
- }
- if(niza[j]-niza[i]>m)
- {
- break;
- }
- }
- }
- cout<<k<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement