cses and codeforces

Author: muditmahajan21

CSES/Book_Shop.cpp

@@ -0,0 +1,52 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int test;
+    int i, j, k, n, temp, count = 0, ans = 0, sum = 0;
+    
+    cin >> n >> k;
+    int price[n], pages[n];
+    
+    for(i = 0; i < n; i++)
+    {
+        cin >> price[i];
+    }
+    for(i = 0; i < n; i++)
+    {
+        cin >> pages[i];
+    }
+    
+    int dp[n + 1][k + 1];
+
+    for(i = 0; i <= n; i++)
+    {
+        for(j = 0; j <= k; j++)
+        {
+            if(i == 0 || j == 0)
+            {
+                dp[i][j] = 0;
+            }
+            else if(price[i - 1] <= j)
+            {
+                dp[i][j] = max(pages[i - 1] + dp[i - 1][j - price[i - 1]], dp[i - 1][j]);
+            }
+            else
+            {
+                dp[i][j] = dp[i - 1][j];
+            }
+        }
+    }
+
+    
+    ans = dp[n][k];
+
+    cout << ans << endl;
+
+return 0;
+}

CSES/Restaurant_Customers.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    ll i, j, k, n, temp, count = 0, ans = 0, sum = 0;
+    cin >> n;
+    ll a[n], b[n];
+    
+    for(i = 0; i < n; i++)
+    {
+        cin >> a[i] >> b[i];
+    }
+
+    sort(a, a + n);
+    sort(b, b + n);
+
+    i = 0;j = 0;
+    while(i < n)
+    {
+        if(a[i] < b[j])
+        {
+            count++;
+            i++;
+        }
+        else
+        {
+            count--;
+            j++;
+        }
+        ans = max(ans, count);
+    }
+
+    cout << ans << endl;
+return 0;
+}

CSES/Sum_of_Two_Values.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    
+    ll i, j, k, n, temp, count = 0, ans = 0, sum = 0;
+    cin >> n >> k;
+
+    map<ll, ll> m;
+    ll arr[n];
+    for(i = 0; i < n; i++)
+    {
+        cin >> arr[i];
+        if(arr[i] < k)
+        {
+            temp = k - arr[i];
+            
+            if(m.find(temp) != m.end())
+            {
+                j = m.find(temp) -> second;
+                cout << j + 1 << " " << i  + 1 << endl;
+                ans = 1;
+                break;
+            }
+        }
+        m[arr[i]] = i;
+    }
+
+    if(!ans)
+    {
+        cout << "IMPOSSIBLE" << endl;
+    }
+
+return 0;
+}

Codeforces/Codeforces_725_2021/A_Stone_Game.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    cin >> test;
+    while(test--)
+    {
+        ll i, j, k, n, temp, count = 0, ans = 0, sum = 0;
+        cin >> n;
+        ll arr[n];
+        
+        for(i = 0; i < n; i++)
+        {
+            cin >> arr[i];
+            if(arr[i] == 1)
+            {
+                j = i;
+            }
+            if(arr[i] == n)
+            {
+                k = i;
+            }
+        }
+
+        temp = min(j, k);
+        sum = max(j, k);
+
+        ans = min(sum + 1, n - temp);
+        ans = min(ans, n + 1 + temp - sum);
+
+        cout <<ans << endl;
+    }
+
+return 0;
+}

Codeforces/Codeforces_725_2021/B_Friends_and_Candies.cpp

@@ -0,0 +1,48 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    cin >> test;
+    while(test--)
+    {
+        ll i, j, k, n, temp, count = 0, ans = 0, sum = 0;
+        cin >> n;
+        ll arr[n];
+        
+        for(i = 0; i < n; i++)
+        {
+            cin >> arr[i];
+        }
+
+        sum = accumulate(arr, arr + n, sum);
+
+        if(sum % n != 0)
+        {
+            ans = -1;
+        }
+        else
+        {
+            temp = sum / n;
+
+            sort(arr, arr + n);
+
+            for(i = 0; i < n; i++)
+            {
+                if(arr[i] > temp)
+                {
+                    ans++;
+                }
+            }
+        }
+
+        cout << ans << endl;
+    }
+
+return 0;
+}

Codeforces/Codeforces_725_2021/C_Number_of_Pairs.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+#define ll long long int
+#define endl "\n"
+using namespace std;
+
+
+int main()
+{   
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    ll test;
+    cin >> test;
+    while(test--)
+    {
+        ll i, j, k, n, temp, count = 0, ans = 0, sum = 0, l, r;
+        cin >> n >> l >> r;
+        ll arr[n];
+        
+        for(i = 0; i < n; i++)
+        {
+            cin >> arr[i];
+        }
+
+        sort(arr, arr + n);
+
+        ll low = n - 1;
+        ll high = n - 1;
+        i = 0;
+
+        while(i < high)
+        {
+            low = max(i, low);
+            while(low > i and arr[i] + arr[low] >= l)
+            {
+                low--;
+            }
+
+            while(high > low and arr[i] + arr[high] > r)
+            {
+                high--;
+            }
+
+            ans += (high - low);
+            i++;
+        }
+
+        cout << ans << endl;
+    }
+
+return 0;
+}