# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
770382 | Trisanu_Das | Let's Win the Election (JOI22_ho_t3) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k; cin >> n >> k;
vector<pair<int, int> > st(n);
for (int i = 0; i < n; ++i) {
cin >> st[i].a >> st[i].b;
if (st[i].b == -1) st[i].b = 1'000'000'000;
}
sort(begin(st), end(st));
double ans = 1e18;
for (int x = 0; x < k + 1; x++) {
vector< vector<double> > dp(n + 1, vector<double>(k - x + 1, 1e18));
dp[0][0] = 0;
for (int i = 0; i < n; ++i)
for (int j = 0; j < k - x + 1; ++j) {
if (j < k - x) dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j] + (double) st[i].a / (x + 1));
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + (i - j < x ? (double) st[i].b / (i - j + 1) : .0));
}
ans = min(ans, dp[n][k - x]);
}
cout << setprecision(9) << fixed << ans << '\n';
return 0;
}