Create 2300. Successful Pairs of Spells and Potions (#902)

Author: Chayandas07

2300. Successful Pairs of Spells and Potions

@@ -0,0 +1,27 @@
+class Solution {
+public:
+    #define ll long long
+    vector<int> successfulPairs(vector<int>& spells, vector<int>& potions, long long success) {
+        sort(potions.begin(), potions.end());
+        vector<int> ans(spells.size());
+        
+        for (int i = 0; i < spells.size(); i++) {
+            ll sp = spells[i];
+            ll s = 0, e = potions.size() - 1;
+            int ind = -1;
+            
+            while (s <= e) {
+                int mid = (s + e) / 2;
+                if (potions[mid] * sp >= success) {
+                    ind = mid;
+                    e = mid - 1;
+                } else {
+                    s = mid + 1;
+                }
+            }
+            
+            ans[i] = (ind == -1) ? 0 : (potions.size() - ind);
+        }
+        return ans;
+    }
+};