Time: 303 ms (46.55%), Space: 92.1 MB (33.01%) - LeetHub

Author: deepankarvarma

2542-maximum-subsequence-score/2542-maximum-subsequence-score.cpp

@@ -0,0 +1,34 @@
+class Solution {
+public:
+    long long maxScore(vector<int>& nums1, vector<int>& nums2, int k) {
+        
+
+           vector<pair<int,int>> v;
+
+           for(int i=0;i<nums1.size();i++)
+             v.push_back({nums2[i],nums1[i]});
+
+           sort(v.rbegin(),v.rend());
+
+           long long ans = 0;
+           long long currSum = 0;
+
+           priority_queue<int,vector<int>,greater<int>> pq;
+
+           for(int i=0;i<k-1;i++){
+               currSum += v[i].second;
+               pq.push(v[i].second);
+           }
+
+           for(int i = k-1;i<nums1.size();i++){
+               currSum += v[i].second;
+               pq.push(v[i].second);
+               ans = max(ans,currSum*v[i].first);
+
+               currSum -= pq.top();
+               pq.pop();
+           } 
+
+        return ans;    
+    }
+};