Mark and Toys Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Mark and Toys
  5. Discussions

Mark and Toys

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you also have a vidéo explanation here : https://youtu.be/DFQO52aB-qI

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