UVa 11369 Shopaholic

Code：

#include<stdio.h>

#include<stdlib.h>

#include<iostream>

#include<algorithm>

#include<string.h>

#include<map>

#include<vector>

using namespace std;

vector<int> v;

int main()

{

    int cas;

    cin>>cas;

    while(cas--)

    {

        int n,ans=0;

        cin>>n;

        v.clear();

        for(int i=0;i<n;i++)

        {

            int k;

            cin>>k;

            v.push_back(k);

        }

        sort(v.begin(),v.end());

        reverse(v.begin(),v.end());

        for(int i=2;i<n;i+=3)

        {

            if(i>=n) break;

            else

            {

                ans+=v[i];

            }

        }

        cout<<ans<<endl;

    }

    return 0;

}