B. Mahmoud and a Triangle

题目链接
Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn’t accept challenges unless he is sure he can win, so he asked you to tell him if he should accept the challenge. Given the lengths of the line segments, check if he can choose exactly 3 of them to form a non-degenerate triangle.

Mahmoud should use exactly 3 line segments, he can’t concatenate two line segments or change any length. A non-degenerate triangle is a triangle with positive area.

Input
The first line contains single integer n (3 ≤ n ≤ 10⁵) — the number of line segments Mahmoud has.

The second line contains n integers a1, a2, …, an (1 ≤ ai ≤ 10⁹) — the lengths of line segments Mahmoud has.

Output
In the only line print “YES” if he can choose exactly three line segments and form a non-degenerate triangle with them, and “NO” otherwise.

input
5
1 5 3 2 4

output
YES

input
3
4 1 2

output
NO

Note
For the first example, he can use line segments with lengths 2, 4 and 5 to form a non-degenerate triangle.

题解：排序完进行判断 两边之和大于第三边，说明找到了，退出即可

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n,a[N];
int main(){
	scanf("%d",&n);
	for(int i = 0;i < n;i++) scanf("%d",a + i);
	sort(a,a + n);
	for(int i = 2;i < n;i++)
		if(a[i - 2] + a[i - 1] > a[i]){
			printf("YES\n");
			return 0;
		}
	printf("NO\n");
	return 0;
}