Pagini recente » Cod sursa (job #248179) | Borderou de evaluare (job #352912) | Cod sursa (job #859022) | Cod sursa (job #2400338) | Cod sursa (job #3256553)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("test.in");
ofstream fout("test.out");
int n;
int v[803];
int rez;
int main()
{
fin>>n;
for (int i=1;i<=n;i++)
fin>>v[i];
sort(v+1,v+n+1);
for (int i=1;i<=n;i++)
{
for (int j=i+1;j<=n;j++)
{
int st=i+2,dr=n;
while (st<=dr)
{
int mij=((st+dr)>>1);
if (v[i]+v[j]>=v[mij])
st=mij+1;
else
dr=mij-1;
}
rez=rez+dr-j;
}
}
fout<<rez;
return 0;
}