Adding CSES solution

Author: AK-I-RA

CSES/Concert Tickets.cpp

@@ -0,0 +1,47 @@
+#include<bits/stdc++.h>
+#include<iostream>
+using namespace std;
+ 
+#define mod 1000000007
+#define all(x) (x).begin(), (x).end()
+typedef long long ll;
+ 
+ 
+void subMain(){
+    ll n, m, h, t;
+    cin >> n >> m;
+    multiset<int, greater<int>> a;
+    while(n--){
+        cin >> h;
+        a.insert(h);
+    }
+    while(m--){
+        cin >> t;
+        auto it = a.lower_bound(t);
+        if(it==a.end())
+        {
+            cout << "-1" << "\n";
+        }
+        else
+        {
+            cout << *it << "\n";
+            a.erase(it);
+        }
+    }
+ 
+}
+ 
+int32_t main(){
+ 
+ 
+	ios_base::sync_with_stdio(false);
+	cin.tie(0); cout.tie(0);
+ 
+	/*ll t=1;
+	cin >> t;
+	while(t--){
+ 
+	}*/
+	subMain();
+	return 0;
+}

CSES/Movie Festival.cpp

@@ -0,0 +1,45 @@
+#include<bits/stdc++.h>
+#include<iostream>
+using namespace std;
+ 
+#define mod 1000000007
+#define all(x) (x).begin(), (x).end()
+typedef long long ll;
+ 
+ 
+void subMain(){
+    vector<pair<ll,ll>> v;
+       ll n;
+       cin>>n;
+       for(ll i=0;i<n;i++){
+          ll a,c;
+          cin>>a>>c;
+          v.push_back({c,a});
+       }
+       sort(v.begin(),v.end());
+       ll curr=v[0].first;
+       ll ans=1;
+       for(ll i=1;i<n;i++){
+           if(v[i].second>=curr){
+            curr=v[i].first;
+            ans++;
+           }
+       }
+       cout<<ans<<"\n";
+    }
+ 
+int32_t main(){
+ 
+ 
+	ios_base::sync_with_stdio(false);
+	cin.tie(0); cout.tie(0);
+ 
+	/*ll t=1;
+	cin >> t;
+	while(t--){
+        subMain();
+	}*/
+	subMain();
+ 
+	return 0;
+}

CSES/Restaurant Customers.cpp

@@ -0,0 +1,49 @@
+#include<bits/stdc++.h>
+#include<iostream>
+using namespace std;
+ 
+#define mod 1000000007
+#define all(x) (x).begin(), (x).end()
+typedef long long ll;
+ 
+ 
+void subMain(){
+    ll n, x, y;
+    cin >> n;
+    vector<pair<int, bool>> v;
+    for(ll i = 0; i < n; i++){
+        cin >> x >> y;
+        v.push_back(make_pair(x, true));
+        v.push_back(make_pair(y, false));
+    }
+    sort(all(v));
+    int ans = 0, cnt = 0;
+    for(ll i = 0; i < v.size(); i++){
+        if(v[i].second==true)
+        {
+            cnt++;
+            ans = max(ans, cnt);
+        }
+        else
+        {
+            cnt--;
+        }
+    }
+    cout << ans << "\n";
+}
+ 
+int32_t main(){
+ 
+ 
+	ios_base::sync_with_stdio(false);
+	cin.tie(0); cout.tie(0);
+ 
+	/*ll t=1;
+	cin >> t;
+	while(t--){
+        subMain();
+	}*/
+	subMain();
+ 
+	return 0;
+}