제출 #1019636

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1019636		overwatch9	Sure Bet (CEOI17_sure)	C++17	0 / 100	1 ms	348 KiB

sure

#include <bits/stdc++.h>
using namespace std;
using dbl = double;
int main() {
    int n;
    cin >> n;
    vector <pair <dbl, dbl>> nums(n);
    for (int i = 0; i < n; i++)
        cin >> nums[i].first >> nums[i].second;
    dbl ans = 0;
    for (int i = 0; i < (1 << n); i++) {
        dbl l = 0;
        vector <dbl> pts;
        for (int j = 0; j < n; j++) {
            if (i & (1 << j))
                l += nums[j].first;
            else
                pts.push_back(nums[j].second);
        }
        sort(pts.begin(), pts.end(), greater <dbl> ());
        int cnt = __builtin_popcount(i);
        dbl r = 0;
        for (auto j : pts) {
            r += j;
            cnt++;
            if (r >= l)
                break;
        }
        ans = max(ans, min(l, r) - cnt);
    }
    cout << fixed << setprecision(4) << ans << '\n';
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 40
• Subtask 3: 0 / 40