POJ 2593

 #include <iostream>
 #include <stdio.h>
 using namespace std;
 int cmp ( const void *a , const void *b )
 {
     return *(int *)b - *(int *)a;
 }
 int main()
 {
     int sum,n,flag,i,a[];
     while ()
     {
         sum=;
         flag=;
         scanf("%d",&n);
         if (n==)
             break;
         for (i=;i<n;i++)
         {
             scanf("%d",&a[i]);
             if (a[i]>)
             {
                 flag++;
                 sum+=a[i];
             }
         }
         if (flag==||flag==)
         {
             qsort(a,n,sizeof(a[]),cmp);
             printf("%d\n",a[]+a[]);
         }
         else printf("%d\n",sum);
     }
     return ;
 }