Submission #995621

#	Time	Username	Problem	Language	Result	Execution time	Memory
995621		vyshniak_n	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	5 ms	492 KiB

Main

//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")
 
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
using namespace std;
 
#include <random>
mt19937 rnd(time(0));
 
const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll N = 1e6 + 10;
const ll mod = 1e9 + 7;
const ll LOG = 20;
const ll K = 1e3 + 20;
 
void solve() {
    ll n, k;
    cin >> n >> k;

    vector <ll> a(n), b(n);
    for (ll i = 0; i < n; i++)
        cin >> a[i] >> b[i];

    vector <ll> order;
    for (ll i = 0; i < n; i++)
        if (b[i] != -1)
            order.pb(i);

    sort(all(order), [&](const ll &i, const ll &j) -> bool {
        if (b[i] == b[j])
            return a[i] < a[j];
        return b[i] < b[j];
    });

    ld ans = inf, cur = 0;
    ll cnt = 1;

    for (ll i = -1; i < (ll)order.size(); i++) {
        if (i != -1) {
            cur += (ld)b[order[i]] / (ld)cnt;
            cnt++;
        }

        vector <bool> used(n);
        for (ll j = 0; j <= i; j++)
            used[order[j]] = 1;

        vector <ll> c;
        for (ll j = 0; j < n; j++)
            if (!used[j])
                c.pb(a[j]);

        sort(all(c));

        ll sum = 0;
        for (ll j = 0; j < k - i - 1; j++)
            sum += c[j];

        ld now = cur + (ld)sum / (ld)cnt;
        ans = min(ans, now);
    }

    cout << fixed << setprecision(15) << ans << el;
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
 
    int tests = 1;
    //cin >> tests;
 
    while (tests--) 
        solve();
    return 0;
}
/*
*/

• 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