這個題的題意是,求花費最小中盤子最大的.所以求最大公約數就行了.
然后注意數值的范圍,用 long long

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;

ll gcd(ll a, ll b)
{
    return a == 0 ? b : gcd(b % a, a);
}
int main()
{
    int T;
    scanf("%d",&T);

    while (T--) {
        int N;
        scanf("%d",&N);
        ll sum = 0,flag = 0,num;
        for(ll i= 0;i < N;i++){
            scanf("%lld",&num);
            sum += num;
            flag = gcd(num,flag);
        }

        printf("%I64d %I64d\n",sum,flag);
    }
    return 0;
}