Priority Queue Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\nO(N*LogN)\n\n- Space complexity:\nO(N)\n\n# Code\n```\nclass Solution {\npublic:\n    int miceAndCheese(vector<int>& reward1, vector<int>& reward2, int k) {\n        priority_queue<int> pq;\n        int n = reward1.size();\n\n        int sum = 0;\n\n\n        for(auto it : reward2)sum += it;\n        for(int i=0;i<n;i++){\n\n            pq.push(reward1[i]-reward2[i]);\n        }\n\n        int curr = sum;\n        for(int i=0;i<k;i++){\n\n            int x = pq.top();\n            pq.pop();\n\n\n\n            curr += x;\n        }\n\n        return curr;\n\n        \n    }\n};\n```
['C++']