题解 | #小苯的木棍切割#

#include #include #include #include <math.h> #include #include <unordered_map> #include #include #include #include

using namespace std;

typedef long long ll;

void solve() { int n; cin >> n;

vector<ll>arr(n);
for (int i = 0; i < n; ++i)cin >> arr[i];

sort(arr.begin(), arr.end());

ll MAX = n * arr[0];
for (int i = 1; i < n; ++i)
{
    MAX = max(MAX, (n - i) * (arr[i] - arr[i - 1]));
}

cout << MAX << '\n';

}

int main() { ios::sync_with_stdio(false); cin.tie(nullptr);

int t;
cin >> t;

while (t--)
    solve();

return 0;

}