#include using namespace std; typedef long long ll; typedef pair P; #define REP(i,n) for(ll i=0;i> T; while(T--){ ll N; cin >> N; vector A(N); ll s=0; REP(i,N){ cin >> A[i]; s+=A[i]; } sort(A.begin(),A.end()); if(A[N-1]>s-A[N-1]) cout << 2*(s-A[N-1])+1 << endl; else cout << s << endl; } return 0; }