n = int(input())
for i in range(n):
k = int(input())
A = list(map(int, input().split()))
A.sort()
if k > 1:
s = 0
for j in range(0, k-1):
s+=A[j]
if A[-1] == 0:
print(0)
elif A[-1] > s:
print(A[-1] - s)
elif A[-1] != 0:
print(1)
else:
print(0)#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
long long maxi=0;
long long sum=0;
for(int i=0;i<n;i++){
long long x;
cin>>x;
sum+=x;
maxi=max(x,maxi);
}
sum-=maxi;
if(sum==0&&maxi==0){
cout<<0<<endl;
}
else if(sum>=maxi){
cout<<1<<endl;
}
else cout<<maxi-sum<<endl;
}
return 0;
}MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |