There are n cities in Byteland, and the ith city has a value ai. The cost of building a bidirectional road between two cities is the sum of their values. Please calculate the minimum cost of connecting these cities, which means any two cities can reach each other.
The first line is an integer T(T≤10^5), representing the number of test cases.
For each test case, the first line is an integer n(n≤10^5), representing the number of cities, the second line are n positive integers ai(ai≤10^5), representing their values.
For each test case, output an integer ans, the minimum cost of connecting these cities.
using namespace std;
int minx = a;
int index = 0;
minx = a[i];
index = i;
long long int ans = 0;