class Solution
{
public:
    int minimumCost(vector<int>& cost) 
    {
        sort(cost.begin(),cost.end(),greater<>());
        int count=0,sum=0;
        for(int i=0;i<cost.size();i++)
        {
            sum+=cost[i];
            count++;
            if(count==2)
            {
                i++;
                count=0;
            }
        }
        return sum;
    }
};