Submission #863805

#	Time	Username	Problem	Language	Result	Execution time	Memory
863805		prairie2022	Let's Win the Election (JOI22_ho_t3)	C++17	0 / 100	5 ms	600 KiB

Main

#include<bits/stdc++.h>
typedef long long ll;
#define fastio cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
using namespace std;

#define F first 
#define S second

int main(){
    fastio
    const int big = 50001;
    int n, k;
    double ans = big;
    cin >> n >> k;
    vector<pair<int, int>> ba(n);
    for(int i=0; i<n; i++){
        cin >> ba[i].S >> ba[i].F;
        if(ba[i].F==-1) ba[i].F = big;
    }
    sort(ba.begin(), ba.end());
    for(int i=0; i<k; i++){
        if(i && ba[i-1].F==big) break;
        double tmp = 0;
        for(int j=0; j<i; j++){
            tmp += ((double)ba[j].F)/(1+j);
        }
        vector<int> rem(n-i);
        for(int j=i; j<n; j++) rem[j-i] = ba[j].S;
        sort(rem.begin(), rem.end());
        int hr = 0;
        for(int j=0; j<k-i; j++) hr += rem[j];
        tmp += ((double)hr)/(1+i);
        ans = min(ans, tmp);
    }
    cout << fixed << setprecision(6) << ans << '\n';
    return 0;
}

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