Create Aditya Singh

Author: adityasingh-0803

Problems/Data-structures/Day-04/sol/Aditya Singh

@@ -0,0 +1,50 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    long long x;
+    int k;
+    cin >> x >> k;
+
+    vector<vector<long long>> lists(k);
+    for (int i = 0; i < k; i++) {
+        int l;
+        cin >> l;
+        lists[i].resize(l);
+        for (int j = 0; j < l; j++) {
+            cin >> lists[i][j];
+        }
+    }
+
+    // Pointer for each list
+    vector<int> ptr(k, 0);
+
+    // Max heap: {value, list_index}
+    priority_queue<pair<long long, int>> pq;
+
+    // Push first element of each list
+    for (int i = 0; i < k; i++) {
+        pq.push({lists[i][0], i});
+    }
+
+    while (!pq.empty()) {
+        auto [val, idx] = pq.top();
+        pq.pop();
+
+        if (x + val < 0) break;
+
+        x += val;
+        ptr[idx]++;
+
+        // Push next element from the same list if exists
+        if (ptr[idx] < (int)lists[idx].size()) {
+            pq.push({lists[idx][ptr[idx]], idx});
+        }
+    }
+
+    cout << x << "\n";
+    return 0;
+}