PROBLEM LINK:
Author: Chandan Boruah
Tester: Chandan Boruah
Editorialist: Chandan Boruah
DIFFICULTY:
CAKEWALK
PREREQUISITES:
Math, Sorting
PROBLEM:
You have to find the minimum sum of numbers from a list after removing a given number of numbers.
QUICK EXPLANATION:
Just sort the array, reverse it and sum the values from required value.
EXPLANATION:
Sort the array, so that the highest values are found at the end. Then Reverse the array(optional, so that calculation is easy…faster to type, being a “quick match”) and start summing after the required count of numbers.
Video Editorial!!
(Innovative editorial, please let me know if this is fine?)