Submission #534201

#TimeUsernameProblemLanguageResultExecution timeMemory
534201LittleOrangeLet's Win the Election (JOI22_ho_t3)C++17
10 / 100
20 ms324 KiB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool cmp(pair<double,double> a,pair<double,double> b){
    return a.second==b.second?a.first<b.first:a.second<b.second;
}
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int n,k;
    cin >> n >> k;
    vector<pair<double,double> > dat(n);
    for (int i = 0;i<n;i++){
        cin >> dat[i].first >> dat[i].second;
        if (dat[i].second<0) dat[i].second = 100000000;
    }
    double ans = 1000000;
    for (int i = 0;i<k;i++){
        double t = 0;
        sort(dat.begin(),dat.end(),cmp);
        for (int j = 0;j<i;j++){
            t += dat[j].second/(j+1);
        }
        sort(dat.begin()+i,dat.end());
        for (int j = i;j<k;j++){
            t += dat[j].first/(i+1);
        }
        ans = min(ans,t);
    }
    cout << fixed << setprecision(15) << ans << "\n";
}
#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...