提出 b0ae20e8-6963-41e9-859e-8b82fb39bb5c

コード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using xy = array<ll, 2>;
constexpr ll inf = 10000000000000000ll;
#define int ll

signed main() {
    int n, m; ll h; cin >> n >> m >> h;
    assert(n <= 20);
    vector<xy> v(n);
    for (auto& [a, b] : v) cin >> a >> b;
    ll ans = inf;
    for (ull bit = 0; bit < (1ull << n); bit++) {
        ll cost = 0, solved = 0, mx = 0;
        for (int i = 0; i < n; i++) {
            if (bit & (1ull << i)) {
                cost += v[i][0];
                ++solved;
                mx = max(mx, v[i][1]);
            }
        }
        if (solved >= m && cost <= h)  {
            ans = min(ans, mx);
        }
    }
    cout << (ans == inf ? -1ll : ans) << endl;
}

結果

問題	点数	言語	結果	実行時間	メモリ
G - Contest	50	C++	RE	90 ms	3740 KiB