Add Day 14 solution in C++

[ReyKan-KP]

🚀 What does this PR do?

• Adds the solution for LeetCode Daily Challenge on Monday and 14th October in C++.

• Briefly explain the approach taken to solve the problem:

  • Utilized a max-heap (priority queue) to efficiently extract and update the largest element k times.
  • Repeatedly replaced the maximum element with its one-third value (rounded up) while adding the max to the sum.

📝 Issue Reference:

Fixes issue: #14

🔍 Checklist:

Please ensure the following before submitting your PR:

• [ ] I have placed my solution in the correct folder (solutions/day14/).
• [ ] My code follows clean coding practices and is efficient.
• [ ] I have added comments in my code to explain the approach.
• [ ] I have updated the README.md for the specific day with a brief explanation of my solution.
• [ ] I have tested the solution on LeetCode and it works correctly.

🔧 Solution Details:

• Language Used: C++
• Time Complexity: O(n log n + k log n)
• Space Complexity: O(n)

🌟 Additional Notes (if any):

[ReyKan-KP]

Adds the solution for LeetCode Daily Challenge on Monday and 14th October in C++