Codeforces Round #603 (Div. 2), problem: (A) Sweet Problem

#include<bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define pb push_back
#define pob pop_back
#define all(a) a.begin(),a.end()
#define fio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
#define i64 long long int
#define mem(x,y) memset(x,y,sizeof(x))
#define fill(arr,b) fill(arr, arr+sizeof(arr)/sizeof(arr[0]), b)

const double pi = acos(-1.0);
const int maxn = (i64)2e5+5;

int main()
{
    fio;
    int t;
    cin>>t;
    while(t--)
    {
        int arr[3];
        for(int i = 0 ; i<3 ; i++) cin>>arr[i];

        sort(arr,arr+3);
        if(arr[2]>=arr[0]+arr[1]) cout<<arr[0]+arr[1]<<endl;
        else cout<<(arr[0]+arr[1]+arr[2])/2<<endl;
    }

return 0;
}