Create Deep Dowbn Below.cpp

Author: MathProgrammer

2021/Div 2/740/Programs/Deep Dowbn Below.cpp

@@ -0,0 +1,68 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int possible(vector <pair <long long, long long> > &L, long long x)
+{
+    for(int i = 0; i < L.size(); i++)
+    {
+        if(x < L[i].first)
+        {
+            return false;
+        }
+
+        x += L[i].second;
+    }
+
+    return true;
+}
+
+void solve()
+{
+    int no_of_levels;
+    cin >> no_of_levels;
+
+    vector <pair <long long, long long> > level;
+    for(int i = 1; i <= no_of_levels; i++)
+    {
+        int no_of_monsters;
+        cin >> no_of_monsters;
+
+        long long power = 0, increment = no_of_monsters;
+        for(int j = 1; j <= no_of_monsters; j++)
+        {
+            long long x;
+            cin >> x;
+
+            power = max(power, x + 1 - (j - 1));
+        }
+
+        level.push_back(make_pair(power, increment));
+    }
+
+    sort(level.begin(), level.end());
+
+    long long total_increment = 0, power_required = 0;
+    for(int i = 0; i < no_of_levels; i++)
+    {
+        power_required = max(power_required, level[i].first - total_increment);
+        total_increment += level[i].second;
+    }
+
+    cout << power_required << "\n";
+}
+
+int main()
+{
+    int no_of_test_cases;
+    cin >> no_of_test_cases;
+
+    while(no_of_test_cases--)
+        solve();
+
+    return 0;
+}
+
+