100% FASTER || C++ || SORTING || EASY TO UNDERSTAND
\nclass Solution {\npublic:\n    int miceAndCheese(vector<int>& v1, vector<int>& v2, int k) {\n        int ans = 0,i=0,n=v1.size();\n        vector<int> v;\n   
````\nclass Solution {\npublic:\n    int miceAndCheese(vector<int>& v1, vector<int>& v2, int k) {\n        int ans = 0,i=0,n=v1.size();\n        vector<int> v;\n        for(i = 0; i < n; i++){\n            v.push_back(v1[i]-v2[i]);\n            ans += v2[i];\n        }\n        sort(v.begin(),v.end());\n        i = n-1;\n        while(k--){\n            ans += v[i];\n            i--;\n        }\n        return ans;\n    }\n};\n````
['Array', 'Greedy', 'C', 'Sorting', 'C++']