제출 #1057380

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1057380		Alebn	Let's Win the Election (JOI22_ho_t3)	C++14	10 / 100	2 ms	2396 KiB

Main

#include <bits/stdc++.h>
#define int double

using namespace std;

void solve() {
    int n, k;
    cin >> n >> k;
    vector<pair<int,int>> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i].first >> a[i].second;
        if(a[i].second == -1) a[i].second = INT_MAX;
    }
    sort(a.begin(), a.end(), [](pair<int,int> a, pair<int,int> b){return a.second < b.second;});
    vector<vector<int>> dp(n + 1, vector<int>(k + 1, INT_MAX));
    dp[n][0] = 0;
    for(int i = n - 1; i > -1; i--) {
        for(int j = 0; j <= k; j++) dp[i][j] = min(dp[i + 1][j], (!j || dp[i + 1][j - 1] == INT_MAX ? INT_MAX : dp[i + 1][j - 1] + a[i].first));
    }
    int res = dp[0][k], val = 0;
    for(int i = 0; i < n; i++) {
        if(a[i].second == INT_MAX) break;
        val += a[i].second / (i + 1);
        res = min(res, val + dp[i + 1][k - i - 1] / (i + 2));
    }
    cout << res << "\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout << fixed << setprecision(6);
    solve();
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 33
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23