diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/remove_stones.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/remove_stones.cpp')
-rw-r--r-- | other/remove_stones.cpp | 24 |
1 files changed, 0 insertions, 24 deletions
diff --git a/other/remove_stones.cpp b/other/remove_stones.cpp deleted file mode 100644 index f267b0c..0000000 --- a/other/remove_stones.cpp +++ /dev/null @@ -1,24 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int minStoneSum(vector<int> &piles, int k) { - priority_queue<int> pq(piles.begin(), piles.end()); - int ans = accumulate(piles.begin(), piles.end(), 0); - while (k--) { - int i = pq.top(); - pq.pop(); - pq.push(i - i / 2); - ans -= i / 2; - } - return ans; - } -}; - -int main() { - Solution obj; - vector<int> piles1 = {5, 4, 9}, piles2 = {4, 3, 6, 7}; - cout << obj.minStoneSum(piles1, 2); // expect: 12 - cout << endl; - cout << obj.minStoneSum(piles2, 3); // expect: 12 -} |