快速排序c/c++

#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<time.h>
using namespace std;
int a[100];
int n;
int d;
int f;
void Qsort(int l,int r)
{
    srand(time(NULL));
    int k;
    if(left>=right)
        return;
    if(r-l>=1)
        k=rand()%(r-l+1)+l;
    else
        k=l;
    swap(a[l],a[k]);
    int i=l;
    int j=r;
    while(i<j)
    {
        while(a[j]>=a[i]&&j>i)
            j--;
        if(j>i)
        {
            swap(a[i],a[j]);
            i++;
        }
        while(a[i]<a[j]&&j>i)
            i++;
        if(j>i)
        {
            swap(a[i], a[j]);
            j--;
        }
        Qsort(l,i-1);
        Qsort(i+1,r);
    }
}

int main(){
    cin >> n;
    cin >> d;
    for(int i=0;i<n;i++)
        cin >> a[i];
    Qsort(0,n-1);
    int ans=0;
    int left,right;
    int mid;
    left=0;
    right=n-1;
    for(int i=0;i<n;i++)
    {
        left=i;
        right=n-1;
        while(left<right)
        {
            mid=(left+right+1)/2;
            if(a[mid]-a[f]<=d)
            {
                left=mid+1;
            }
            else
               right=mid-1;
            ans+=(mid-1-i);
        }
        i=i+1;
    }

    cout << ans;
    return 0;
}