アリ本 1-6 p21 三角形

ant-1-6-p21.cpp

#include <cstdio>
#include <algorithm>

using namespace std;

const int MAX_N = 50;

int n, a[MAX_N];

void solve(){
  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], a[j], a[k]});
        int rest = len - ma;

        if (ma < rest){
          ans = max(ans, len);
        }
      }
    }
  }
  printf("%d\n", ans);
}

int main(){
  scanf("%d", &n);
  for (int i = 0; i < n; i++){
    scanf("%d", &a[i]);
  }
  solve();
}