三角形

​
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 1000;
int a[maxn];
int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
		scanf_s("%d", &a[i]);
	int ans = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = i + 1; j < n; j++)
		{
			for (int k = j + 1; k < n; k++)
			{
				int len = a[i] + a[j] + a[k];
				int ma = max(a[i], max(a[j], a[k]));
				int rest = len - ma;
				if (ma < rest)
				{
					ans = max(len, ans);
				}
			}
		}
	}
	cout << ans << endl;
	system("pause");
	return 0;
}

​