제출 #391173

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
391173		palilo	새로운 문제 (POI13_tak)	C++17	90 / 100	136 ms	4172 KiB

tak

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
#ifdef home
    freopen("in", "r", stdin);
    freopen("out", "w", stdout);
#endif
    int64_t m, d;
    int n;
    cin >> m >> d >> n;

    vector<int64_t> a(n);
    for (auto& x : a) cin >> x;

    sort(a.begin(), a.end(), greater<int64_t>());

    int64_t last_taxi;
    if (auto it = upper_bound(a.begin(), a.end(), m - d, greater<int64_t>()); it == a.begin())
        return cout << 0, 0;
    else {
        last_taxi = *prev(it);
        a.erase(prev(it));
    }

    int64_t pos = 0;
    int ans = 0;
    for (const auto& x : a) {
        if (x <= d - pos)
            return cout << (last_taxi < (d - pos) + (m - pos) ? 0 : ans + 1), 0;
        pos += x - (d - pos);
        ++ans;
        if (pos >= d) break;
    }
    cout << ans + (pos < m);
}

• Subtask 1: 0 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10