POJ 3253 Fence Repair

#include<iostream> #include<algorithm> using namespace std; int main() {int n;while (cin >> n){int a[20002];for (int i = 0; i < n; i++)cin >> a[i];if (n == 1){cout << a[0] << endl; continue;}sort(a, a

>>阅读原文<<