http://220.180.209.150:38888/problem/30
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
#define LL long long
#define MAXN 6005
int a[MAXN],n; LL ans;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;++i)scanf("%d",a+i);
sort(a+1,a+1+n);
for(int i=1;i<n-1;++i){
for(int j=i+1,k=j+1;j<n;++j){
while(a[i]+a[j]>a[k]&&k<=n)
k++;
ans+=k-j-1;
}
}
cout << ans << endl;
return 0;
}