#include"bits/stdc++.h"
#define ll long long
using namespace std;
const int N = 2e5+5;
ll t,n,m,l;
ll s[N];
int main()
{
ios::sync_with_stdio(false);
cin >> t;
while (t--)
{
cin >> n;
for(int i=1 ;i<=n;i++) cin >> s[i];
sort(s+1,s+1+n);
ll sum = s[1];
for(int i=2;i<=n;i++){
sum = max(sum,s[i]-s[i-1]);
}
cout << sum << endl;
}
return 0;
}
Minimum Extraction
Guess you like
Origin blog.csdn.net/weixin_53013914/article/details/121171729
Recommended
Ranking