HELP (why give's TLE)
\nclass Solution {\npublic:\n    int miceAndCheese(vector<int>& reward1, vector<int>& reward2, int k) {\n        vector<vector<int>> nums(reward1.size());\n    
```\nclass Solution {\npublic:\n    int miceAndCheese(vector<int>& reward1, vector<int>& reward2, int k) {\n        vector<vector<int>> nums(reward1.size());\n        for(int i=0;i<reward1.size();i++){\n            nums[i] = {reward1[i]-reward2[i],reward1[i],reward2[i]};\n        }\n        sort(nums.begin(),nums.end(),[&](const vector<int> a,const vector<int> b){\n            return a[0]>b[0];\n        });\n        long long ans=0;\n        int i=0;\n        while(i<k) ans += nums[i++][1];\n        while(i<nums.size()) ans += nums[i++][2];\n        return ans;\n    }\n};\n```
[]