CSES-Problem-Set-Solutions/22. Ferris Wheel.cpp at main · D-Ajay-Kumar/CSES-Problem-Set-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{
    ll n, x, elem, gondolas = 0;
    cin >> n >> x;

    vector<ll> v;

    for(ll i=0; i<n; i++)
    {
        cin >> elem;
        v.push_back(elem);
    }

    sort(v.begin(), v.end());

    ll i = 0;
    ll j = (v.size()-1);

    while(i <= j)
    {
        if(i == j)
        {
            if(v[i] <= x)
            {
                gondolas += 1;
                break;
            }
        }

        if(v[i] + v[j] <= x)
        {
            gondolas += 1;
            i += 1;
            j -= 1;
            continue;
        }
        else if(v[j] <= x)
        {
            gondolas += 1;
            j -= 1;
        }
        else
        {
            j -= 1;
        }
    }

    cout << gondolas << "\n";

    return 0;
}