题解 | 最小的乘积先排序再分类讨论就行

#include<stdio.h>
#include<stdlib.h>

#define min(a, b) a<b?a:b

int compare(const int *a, const int *b) { return *a - *b; }

int main() {
    int n;
    scanf("%d", &n);
    int nums[n];
    for (int i = 0; i < n; i++) scanf("%d", &nums[i]);
    qsort(nums, n, sizeof(int), compare);
    printf("%lld", min((long long) nums[0] * nums[1] * nums[2], (long long) nums[0] * nums[n - 2] * nums[n - 1]));
    return 0;
}