题解 | 小苯的木棍切割
小苯的木棍切割
https://www.nowcoder.com/practice/35dbc078196944c59731322e8cc29014
#include "bits/stdc++.h"
using ll = long long;
using namespace std;
int main() {
int t;
cin>>t;
while(t-->0)
{
ll n;
cin>>n;
vector<ll>a(n);
for(ll i=0;i<n;++i)
{
cin>>a[i];
}
sort(a.begin(),a.end());
ll maxnum = 0;
for(ll i=0;i<n-1;++i)
{
ll c = a[i+1]-a[i];
maxnum = max(maxnum,c*(n-i-1));
}
maxnum = max(maxnum,a[0]*n);
cout<<maxnum<<endl;
}
}
// 64 位输出请用 printf("%lld")
