participated in leetcode contest

Author: piyushkhemka

452. Minimum Number of Arrows to Burst Balloons.cpp

@@ -1,7 +1,5 @@
 class Solution {
 public:
-
-
     struct mycomp {
         bool operator() (const pair<int,int> &p1, const pair<int,int> &p2) {
             return p1.first > p2.first;
@@ -29,17 +27,12 @@ class Solution {
             pair<int,int> top;
             pair<int,int> sec;
 
-
-
             top = pq.top();
             pq.pop();
 
             sec = pq.top();
             pq.pop();
 
-            // cout << top.first <<" " << top.second << endl;
-            // cout << sec.first <<" " << sec.second << endl;
-
             if (top.first <=sec.first && top.second >=sec.second)
                 pq.push({sec.first, sec.second});
 
@@ -53,14 +46,9 @@ class Solution {
 
         }
 
-
-
         if(pq.size() == 1)
             res.push_back(pq.top());
 
-
         return res.size();
-
-
     }
 };

453. Minimum Moves to Equal Array Elements.cpp

@@ -0,0 +1,26 @@
+class Solution {
+public:
+    int minMoves(vector<int>& nums) {
+
+        int ans = 0;
+        int mine = INT_MAX;
+        int sum = 0;
+        for(auto i:nums) {
+
+            mine = min(mine,i);
+            sum += i;
+        }
+
+        ans = sum - nums.size()*mine;
+        return ans;
+    }
+};
+
+
+/*
+
+Addding 1 to n - 1 elements is the same is subtracting 1 from one element, w.r.t goal of making the elements in the array equal.
+So, best way to do this is make all the elements in the array equal to the min element.
+sum(array) - n * minimum
+
+*/

Non-leetcode/add two vectors.cpp

@@ -0,0 +1 @@
+