Submission #785044

#	Time	Username	Problem	Language	Result	Execution time	Memory
785044		gun_gan	Let's Win the Election (JOI22_ho_t3)	C++17	28 / 100	2571 ms	324 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 505;

int N, K;
int a[MX], b[MX];

vector<pair<int, int>> v;

int main() {
      cin.tie(0); ios_base::sync_with_stdio(0);

      cin >> N >> K;

      for(int i = 0; i < N; i++) {
            cin >> a[i] >> b[i];
      }

      double ans = 1e9;
      for(int i = 0; i < (1 << N); i++) {
            bool can = 1;
            for(int j = 0; j < N; j++) {
                  if((i >> j & 1) && b[j] == -1) can = 0;
            }

            if(!can) continue;

            double res = 0;
            int cnt = 1;

            vector<int> v;
            for(int j = 0; j < N; j++) {
                  if(i >> j & 1) v.push_back(b[j]);
            }

            sort(v.begin(), v.end());
            for(auto x : v) {
                  res += (double) x / cnt;
                  cnt++;
            }

            if(cnt > K) continue;

            v.clear();

            for(int j = 0; j < N; j++) {
                  if(!(i >> j & 1)) v.push_back(a[j]);
            }

            sort(v.begin(), v.end());

            for(int i = 0; i < K - cnt + 1; i++) {
                  res += (double) v[i] / cnt;
            }

            ans = min(ans, res);
      }

      cout << fixed << setprecision(10) << ans << '\n';

}     

• Subtask 1: 5 / 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