Advertisement
Guest User

Untitled

a guest
Mar 22nd, 2018
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.76 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int findPairOfDifference(long long arr[],long long n,long long k){
  5. long long i=0,j=1,cnt=0;
  6. while(i<n && j<n){
  7. if(i!=j && arr[j]-arr[i]==k){
  8. cnt++;
  9. //cout<<"arr[j]="<<arr[j]<<" "<<"arr[i]="<<arr[i]<<endl;
  10. j++;
  11. }
  12. else if(arr[j]-arr[i]<k){
  13. //cout<<"sum="<<arr[j]-arr[i]<<endl;
  14. j++;
  15. }
  16. else{
  17. i++;
  18. }
  19. }
  20. return cnt;
  21.  
  22. }
  23. int main(){
  24. long long n,i,k;
  25. cin>>n;
  26. long long arr[n];
  27. for(i=0;i<n;i++){
  28. cin>>arr[i];
  29. }
  30. cin>>k;
  31. sort(arr,arr+n);
  32. int result=findPairOfDifference(arr,n,k);
  33. cout<<result*2<<endl;
  34. return 0;
  35. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement