Seeeee ☻ C++:

​#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int cmp(const void * a,const void * b)
 {
   return (*(long long int *)a + *(long long int *)b);  
 }  

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    long long int i,t,n,v=0,len,sum=0,c=0,index=0;
    long long int f1[3];
     cin>>t;
     while(t!=0)
     {
       sum=0;c=0;v=0,index=0; 
       cin>>n;
       long long int ar[n];
       for(i=0;i<n;i++)
             cin>>ar[i];
       qsort(ar,n,sizeof(long long int),cmp);
       for(i=0;c<3;i++)
           {
               if(c==0)
                 {
                   f1[index++]=ar[i];
                   v=ar[i];
                   c++;
                 }
                else if(v!=ar[i])
                  {
                      f1[index++]=ar[i];
                       v=ar[i];
                      c++;
                  } 
           }
          sum=0;
          for(i=0;i<3;i++)
                sum=sum+f1[i];
       cout<<sum<<endl;
       t--;  
    }
    return 0;
}​