链接:https://www.nowcoder.com/acm/contest/90/J 来源:牛客网
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 1000000000;
const int maxn = 100;
int dp[100005];
int T,n,count;
bool com(int a,int b)
{
return a<b;
}
bool ans(int n)
{
if(dp[1]==dp[n])
return true;
else
return false;
}
int main()
{
cin>>T;
while(T-->0)
{
cin>>n;
int count=0,sum=0,number=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&dp[i]);
sum+=dp[i];
}
sort(dp+1,dp+n+1,com);
if(ans(n))
printf("%d %d",count,dp[1]);
count=sum-dp[1]*n;
number=dp[1]+count;
cout<<count<<" "<<number<<endl;
}
}