算法笔记2

#include "stdio.h"
#include "stdlib.h"
#include "malloc.h"
//从n根棍子中，找出能组成三角形的周长最大的三根棍子
int main(){

int n;
scanf_s("%d",&n);
int *a = (int*)malloc(sizeof(int)*n);
for (int i = 0; i < n; i++){
scanf_s("%d",&a[i]);
}
int sum=0;
for (int i = 0; i < n; i++){
for (int j = i+1; j < n; j++){
for (int k = j + 1; k < n; k++){
if ((a[i] + a[j] >= a[k]) && (a[j] + a[k] >= a[i]) && (a[j] + a[k] >= a[i])){
if (sum> a[i] + a[j] + a[k]){
sum = sum;

}
else{
sum = a[i] + a[j] + a[k];
}

}

}
}

}

printf("%d",sum);
system("pause");

return 0;
}