int maximumToys(vector <int> prices, int k)
{
    sort(prices.begin(),prices.end()) ;
    int count = 0 ;
    for(int i = 0 ; i < prices.size() ; i++)
    {
        if(prices[i] <= k)
        {
            k -= prices[i] ;
            count++ ;
        }
    }
    return count ;
}