Pagini recente » Borderou de evaluare (job #1152912) | Cod sursa (job #1959126) | Cod sursa (job #2659203) | Cod sursa (job #1074607) | Cod sursa (job #3256605)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fcin("nrtri.in");
ofstream fout("nrtri.out");
int n,v[100000],nr;
int main()
{
fcin>>n;
for(int i=1; i<=n; i++)
fcin>>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=j+1;
int dr=n;
int val=v[i]+v[j];
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]>val)
{
dr=mij-1;
}
else
{
st=mij+1;
}
}
nr=nr+(dr-j);
}
}
fout<<nr;
return 0;
}