why I'm getting WA for tc 673 class Solution { public: long long minimumCost(vector& nums, int k, int dist) { long long ans=INT_MAX,cur=nums[0],n=nums.size(); multisetl,r; k--; int j=1; for(int i=1;idist){ if(l.find(nums[j])!=l.end()){ cur-=nums[j]; auto it = l.find(nums[j]); l.erase(it); } else{ auto it = r.find(nums[j]); r.erase(it); } j++;
Fantastic approach and intuition brother, thanks for this video
Best channel for leetcoders
Good explanation brother..😊😊✌✌
Awesome explanation
By using only one multiset does we have difficulty while removing elements?
great explanation.. Thanks Alot
great explanation🔥🔥
why I'm getting WA for tc 673
class Solution {
public:
long long minimumCost(vector& nums, int k, int dist) {
long long ans=INT_MAX,cur=nums[0],n=nums.size();
multisetl,r;
k--;
int j=1;
for(int i=1;idist){
if(l.find(nums[j])!=l.end()){
cur-=nums[j];
auto it = l.find(nums[j]);
l.erase(it);
}
else{
auto it = r.find(nums[j]);
r.erase(it);
}
j++;
}
if(i-j==dist){
if(l.size()==k) ans=min(ans,cur);
}
}
return ans;
}
};