度度熊拼三角
#include<iostream>
#include<algorithm>
#include<time.h>
using namespace std;
int cmp(int a,int b)
{
return a>b;
}
int checkfunction(int a,int b,int c)
{
if(a+b>c&&b+c>a&&a+c>b)
return 1;
return 0;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int a[n],i,j,maxnum=-1;
for( i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n,cmp);
for(i=0;i<n;i++)
if(checkfunction(a[i],a[i+1],a[i+2]))
{
maxnum=a[i]+a[i+1]+a[i+2];
break;
}
printf("%d\n",maxnum);
}
return 0;
}