Submission #923830

#	Time	Username	Problem	Language	Result	Execution time	Memory
923830		OAleksa	Let's Win the Election (JOI22_ho_t3)	C++14	23 / 100	2548 ms	632 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int N = 550;
const int inf = 1e18;
int n, k;
pair<int, int> a[N];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n >> k;
  	vector<int> tm;
  	for (int i = 0;i < n;i++) {
  		cin >> a[i].f >> a[i].s;
  		tm.push_back(a[i].f);
  		if (a[i].s == -1)
  			a[i].s = inf;
  	}
  	double ans = 0;
  	sort(tm.begin(), tm.end());
  	for (int i = 0;i < k;i++)
  		ans += tm[i];
  	for (int mask = 1;mask < (1 << n);mask++) {
  		vector<int> gas;
  		for (int i = 0;i < n;i++) {
  			if (mask & (1 << i)) {
  				gas.push_back(a[i].s);
  			}
  		}
  		sort(gas.begin(), gas.end());
  		int m = gas.size();
  		if (m > k)
  			continue;
  		double s = 0;
  		int i = 1;
  		for (auto u : gas)
  			s += (double)u / (i++);
  		vector<int> o;
  		for (int i = 0;i < n;i++) {
  			if (!(mask & (1 << i)))	
  				o.push_back(a[i].f);
  		}
  		sort(o.begin(), o.end());
  		for (int i = 0;i < k - m;i++)
  			s += (double)o[i] / (m + 1);
  		ans = min(ans, s);
  	}
	  cout << fixed << setprecision(15) << ans;
  }
  return 0;
}

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