Added problems

Author: zerefwayne

introductory_problems/increasing_array.cpp

@@ -0,0 +1,53 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long int li;
+typedef long long int lli;
+typedef vector<long long int> vlli;
+typedef vector<int> vi;
+typedef stack<long long int> slli;
+
+void task()
+{
+
+    lli lenNumbers;
+    cin >> lenNumbers;
+
+    lli turns = 0;
+
+    lli prev = 0;
+    lli number;
+
+    for (lli i = 0; i < lenNumbers; i++)
+    {
+
+        cin >> number;
+
+        if (i == 0)
+        {
+            prev = number;
+            continue;
+        }
+
+        if (number <= prev)
+        {
+            turns += prev - number;
+        } else {
+            prev = number;
+        }
+    }
+
+    cout << turns << '\n';
+}
+
+int main()
+{
+
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    task();
+
+    return 0;
+}

sorting_and_searching/towers.cpp

@@ -0,0 +1,48 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long int li;
+typedef long long int lli;
+typedef vector<long long int> vlli;
+typedef vector<int> vi;
+typedef stack<long long int> slli;
+
+void task()
+{
+
+    lli lenCubes;
+    cin >> lenCubes;
+    multiset<lli> stacks;
+    lli cube;
+    for (lli i = 0; i < lenCubes; i++)
+    {
+
+        cin >> cube;
+
+        auto loc = stacks.upper_bound(cube);
+
+        if (loc == stacks.end())
+        {
+            stacks.insert(cube);
+        }
+        else
+        {
+            stacks.erase(loc);
+            stacks.insert(cube);
+        }
+    }
+
+    cout << stacks.size() << '\n';
+}
+
+int main()
+{
+
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    task();
+
+    return 0;
+}