Adding CSES solution

Author: AK-I-RA

CSES/Apartments.cpp

@@ -0,0 +1,42 @@
+#include<bits/stdc++.h>
+#include<iostream>
+using namespace std;
+ 
+#define mod 1000000007
+#define all(x) (x).begin(), (x).end()
+typedef long long ll;
+
+ 
+const int mx = 2e5;
+int n, m, k, a[mx], b[mx];
+
+void subMain(){
+    cin >> n >> m >> k;
+    for(int i = 0; i < n; ++i) cin >> a[i];
+    for(int i = 0; i < m; ++i) cin >> b[i];
+    sort(a, a+n);
+    sort(b, b+m);
+    int ans = 0;
+    for(int i = 0, j = 0; i < n; ++i){
+        while(j < n && b[j] < a[i]-k)
+            j++;
+        if(j < n && b[j] <= a[i]+k)
+            ans++, j++;
+    }
+    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();
+	return 0;
+}

CSES/Distinct Numbers.cpp

@@ -0,0 +1,36 @@
+#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;
+    cin >> n;
+    vector<int>a(n);
+    set<int> s;
+    for(ll i = 0; i < n; i++){
+        cin >> a[i];
+        s.insert(a[i]);
+    }
+    cout << s.size() << "\n";
+}
+ 
+int32_t main(){
+ 
+ 
+	ios_base::sync_with_stdio(false);
+	cin.tie(0); cout.tie(0);
+ 
+	/*ll t;
+	cin >> t;
+	while(t-- > 0){
+	    subMain();
+	}*/
+	subMain(); 
+	return 0;
+}

CSES/Ferris Wheel.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+ 
+using namespace std;
+ 
+int main()
+{
+   int n,k;
+   cin >> n >> k;
+   int w[n];
+   for (int i = 0; i < n; i++) 
+      cin >> w[i];
+   sort(w,w+n);
+   int l = 0, r = n-1;
+   int ans = 0;
+   while (l <= r) {
+      if (w[l]+w[r] < k+1) l++;
+      r--;
+      ans++;
+   }
+   cout << ans << endl;
+   return 0;
+}