+ 1

# Find bug in my code, why i didn't get my expected result?

You are given an array of integers stones where stones[i] is the weight of the ith stone. We are playing a game with the stones. On each turn, we choose the heaviest two stones and smash them together. Suppose the heaviest two stones have weights x and y with x <= y. The result of this smash is: If x == y, both stones are destroyed, and If x != y, the stone of weight x is destroyed, and the stone of weight y has new weight y - x. At the end of the game, there is at most one stone left. Return the weight of the last remaining stone. If there are no stones left, return 0. Example 1: Input: stones = [2,7,4,1,8,1] Output: 1 Explanation: We combine 7 and 8 to get 1 so the array converts to [2,4,1,1,1] then, we combine 2 and 4 to get 2 so the array converts to [2,1,1,1] then, we combine 2 and 1 to get 1 so the array converts to [1,1,1] then, we combine 1 and 1 to get 0 so the array converts to [1] then that's the value of the last stone. https://code.sololearn.com/cfM4DjslR371/?ref=app

21st Dec 2022, 3:40 AM
Rajeev Sharma
1 Antwort
+ 1
First thing you are using priority_queue so please include queue. Then you are creating a vector of int and you have used stone[] , the type does not match. Remove the [] , and add semicolon after the end of the statement
21st Dec 2022, 4:09 AM
Мг. Кнап🌠