大佬们看看CCF小中大这道题为什么80分？

[qq_43330271]

我的代码: #include<iostream> #include<cmath> #include<iomanip> using namespace std; int main() { long long int min = 0, max = 0; long long int n; cin >> n; long long int *p = new long long int[n]; for (long long int i = 0; i < n; i++) cin >> p[i]; for (long long int i = 0; i < n - 1; i++) { if (p[i] > p[i + 1]) { max = p[0]; min = p[n - 1]; break; } if (p[i] < p[i + 1]) { min = p[0]; max = p[n - 1]; break; } } if (n % 2 == 1) { long long int mid = p[n / 2]; cout << max << " " << mid << " " << min; } else { float x = ((float)p[n / 2 - 1] + (float)p[n / 2]) / 2; if (x == (int)x) { long long int mid = (int)x; cout << max << " " << mid << " " << min; } else { cout << max << " "; cout << fixed << setprecision(1) << x; cout << " " << min; } } delete p; return 0;}