leetcode biweekly 100

Author: Pankajcoder1

Codeforces/After Placement/1806A-Walking Master.cpp

@@ -0,0 +1,36 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    long long a,b,c,d;
+    cin>>a>>b>>c>>d;
+    if(d<b){
+        cout<<-1<<endl;
+        return 0;
+    }
+    long long step = d-b;
+    a+=step;
+    if(a<c){
+        cout<<-1<<endl;
+    }
+    else{   
+        step+=(a-c);
+        cout<<step<<endl;
+    }
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

LeetCode/2591.Distribute Money to Maximum Children.cpp

@@ -0,0 +1,45 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+    int distMoney(int money, int children)
+    {
+        int child=0;
+        bool flag=0;
+        if(money<children){
+            return -1;
+        }
+        money-=children;
+        for(int i=1;i<children;i++){
+            if(money>=7){
+                child++;
+                money-=7;
+            }
+            else{
+                return child;
+            }
+        }
+        if(money==3){
+            if(child>0){
+                child--;
+            }
+            else{
+                return -1;
+            }
+        }
+        else if(money==7){
+            child++;
+        }
+
+        return child;
+    }
+};

LeetCode/2592.Maximize Greatness of an Array.cpp

@@ -0,0 +1,43 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+    int maximizeGreatness(vector<int> &nums)
+    {
+        int n=nums.size();
+        vector<pair<int,int>> v1(n);
+        vector<int> v2(n);
+        int count=0;
+        for(int i=0;i<n;i++){
+            v1[i]={nums[i],i};
+            v2[i]=nums[i];
+        }
+        sort(v2.begin(),v2.end());
+        sort(v1.begin(),v1.end());
+        int pos=0;
+
+        for(int i=0;i<n;i++){
+            while(pos<n && v1[i].>=firstv2[pos]){
+                pos++;
+            }
+            if(pos<n){
+                count++;
+                pos++;
+            }
+            else{
+                break;
+            }
+        }
+        return count;
+        
+    }
+};

LeetCode/2593.Find Score of an Array After Marking All Elements.cpp

@@ -0,0 +1,44 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+typedef pair<long long, long long> pi;
+
+class Solution
+{
+public:
+    long long findScore(vector<int> &nums)
+    {
+        long long ans=0;
+        int n=nums.size();
+
+        // min heap
+        priority_queue<pi, vector<pi>, greater<pi>> pq;
+        vector<bool> check(nums.size(), false);
+        
+        for(int i=0;i<n;i++){
+            pq.push({nums[i],i});
+        }
+        while(pq.size()){
+            long long mini=pq.top().first;
+            long long pos=pq.top().second;
+            if(check[pos]==false){
+                ans+=mini;
+                if(pos+1<n){
+                    check[pos+1]=true;
+                }
+                if(pos>=1){
+                    check[pos-1]=true;
+                }
+            }
+            pq.pop();
+        }
+        return ans;
+    }
+};