제출 #956259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
956259		serifefedartar	새로운 문제 (POI13_tak)	C++17	80 / 100	103 ms	12940 KiB

tak

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

#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define LOGN 20
const ll MOD = 998244353;
const ll MAXN = 1e5 + 100;

#define int long long
vector<ll> x;
signed main() {
    fast
    ll m, d, n;
    cin >> m >> d >> n;

    x = vector<ll>(n);
    for (int i = 0; i < n; i++)
        cin >> x[i];
    sort(x.begin(), x.end());

    auto it = lower_bound(x.begin(), x.end(), m - d);
    if (it == x.end()) {
        cout << "0\n";
        return 0;
    }
    int goal = d + (m - d - *it) / 2;
    x.erase(it);

    int cnt = 1;
    int plc = 0;
    while (x.size()) {
        int now = x.back();
        x.pop_back();

        if (now <= d - plc)
            break;

        plc += now - d + plc;
        cnt++;

        if (plc >= goal)
            break;
    }

    cout << (plc < goal ? 0 : cnt) << "\n";
}

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