Maximum Sum With Exactly K Elements

Given nums and k, perform k operations each time choosing an element m, adding m to your score, and replacing it with m+1; return the maximum total score after k operations. The core challenge is a greedy simulation—always pick the current maximum (e.g., via a priority queue)—to maximize the accumulated sum.