http://codeforces.com/problemset/problem/766/B Mahmoud and a Triangle

排个序，判断三个点是否能组成非退化三角形

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI (M_PI)
#define INF (0x3f3f3f3f)
#define MOD (1000000007)
#define EPS (1e-12)
#define MAX (1000000)
#define LEN (MAX+5)
int a[100005],n;
int main()
{
    cin >> n;
    for(int i  = 1;i <= n;++i){
        scanf("%d",&a[i]);
    }
    sort(a + 1,a + n + 1);
    bool f = false;
    for(int i = 3;i <= n;++i){
        if(a[i] < a[i - 1] + a[i - 2]){
            f = true;
            break;
        }
    }
    if(f) cout << "YES" << endl;
    else cout << "NO" << endl;
    return 0;
}