Pagini recente » Cod sursa (job #3135958) | Cod sursa (job #1830564) | Cod sursa (job #1393498) | Cod sursa (job #1389481) | Cod sursa (job #2911098)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int v[1002],i,j,cnt=0,n;
void bin_search (int i, int j)
{
int mij = 0;
int st = j + 1 ;
int dr = n ;
while( st <= dr )
{
mij = (st+dr) / 2 ;
int s = v[i] + v[j] ;
if( v[mij] > s )
dr = mij-1;
else
st = mij+1;
}
cnt += dr - j;
}
int main()
{
cin >> n;
for( i = 1 ; i <= n ; i ++ )
cin >> v[i] ;
sort( v+1 , v+n+1 );
for( i = 1 ; i <= n - 1 ; i ++ )
{
for( j = i + 1 ; j <= n ; j ++ )
{
bin_search(i,j) ;
}
}
cout << cnt ;
return 0;
}