Submission #729278

#TimeUsernameProblemLanguageResultExecution timeMemory
729278tch1cherinLet's Win the Election (JOI22_ho_t3)C++17
5 / 100
1 ms212 KiB
#include <bits/stdc++.h>
using namespace std;

void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n), b(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
  }
  vector<int> order(n);
  iota(order.begin(), order.end(), 0);
  sort(order.begin(), order.end(), [&](int i, int j) {
    return a[i] < a[j];
  });
  long double ans = 1e18;
  for (int max_c = 0; max_c <= n; max_c++) {
    int c = 1, cnt = 0;
    long double res = 0;
    for (int i : order) {
      if (a[i] == b[i] && c < max_c) {
        res += (long double)a[i] / c;
        c++;
        cnt++;
      }
    }
    for (int i : order) {
      if (a[i] != b[i] && cnt < k) {
        res += (long double)a[i] / c;
        cnt++;
      }
    }
    ans = min(ans, res);
  }
  cout << ans << "\n";
}

int main() {
  cout << fixed << setprecision(9);
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...