题解 | 小苯的木棍切割

#include <algorithm>
#include <bits/stdc++.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
    ll T;
    cin >> T;
    while (T--) {
        ll n;
        cin >> n;
        vector<ll>v(n);
        for (int i = 0; i < n; i++) cin >> v[i];
        sort(v.begin(), v.end());
        ll sum = 0, max = -1;
        for (int i = 0; i < n; i++) {
            v[i] = v[i] - sum;
            sum = v[i] + sum;
            if (v[i] * (n - i) > max) max = v[i] * (n - i);
        }
        cout<<max<<endl;
    }
    return 0;
}