Pagini recente » Cod sursa (job #410357) | Cod sursa (job #1042345) | Cod sursa (job #2599282) | Cod sursa (job #2729053) | Cod sursa (job #1196655)
#include <cstdio>
#include <algorithm>
#define IN "nrtri.in","r",stdin
#define OUT "nrtri.out","w",stdout
const int MAX=1000;
using namespace std;
int cb(int st,int l1,int l2);
int v[MAX],n,cnt;
int main()
{
freopen(IN);
freopen(OUT);
scanf("%d",&n);
for(register int i=1;i<=n;i++)
scanf("%d",v+i);
sort(v+1,v+n+1);
for(register int i=1;i<n;i++)
for(register int j=i+1;j<=n;j++)
cb(j+1,v[i],v[j]);
printf("%d",cnt);
return 0;
}
int cb(int st,int l1,int l2){
int dr=n,mij;
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]>l1+l2)
dr=mij-1;
else{
cnt++;
st=mij+1;
}
}
return 0;
}