Submission #1944444

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <string>

using namespace std;

void solve();

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}

void solve() {
    int n,c;
    cin >> n >> c;
    vector<int> v;
    for(int i = 0; i < n; i++) {
        int tmp;
        cin >> tmp;
        v.push_back(tmp);
    }
    sort(v.begin(), v.end());
    int ans = 0;
    while(!v.empty()) {
        int tmp = v.at(0);
        v.erase(v.begin());

        auto result = std::upper_bound(v.begin(), v.end(), c - tmp - 1);
        ans++;
        
        if(result == v.begin()) continue;
        v.erase(result-1);
    }
    cout << ans << endl;

}

Submission Info

Judge Result