TAMHOP C++

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int d[5000005];
int q=1e6;

int main()
{

    ll n,a[5005],res=0,ma=-5000000;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        d[a[i]+q]++;
    }
    sort(a+1,a+1+n);
    for(int i=1;i<=n-1;i++)
        for(int j=i+1;j<=n;j++)
                if(d[2*a[j]-a[i]+q]>0)
                {
                    res=res+d[2*a[j]-a[i]+k];
                    ma=max(ma,3*a[j]);

                }

    cout<<res<<endl;
    cout<<ma;
}