Can anybody help me to understand this problem. I’m not able to understand this problem
You need to find the K friends with the highest total expenses, and output the sum of their total expenses.
Bear in mind that friends may occur in the input multiple times, so you need to find their total expense.
Is that any better?
