제출 #965621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
965621		12345678	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	5 ms	724 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int nx=505;

#define int double

int n, k;
vector<pair<int, int>> v;
double cost, res=DBL_MAX;

int32_t main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    v.resize(n);
    for (int i=0; i<n; i++) 
    {
        cin>>v[i].second>>v[i].first;
        if (v[i].first==-1) v[i].first=1e9;
    }
    sort(v.begin(), v.end());
    for (int i=0; i<n; i++)
    {
        vector<int> t;
        for (int j=i; j<n; j++) t.push_back(v[j].second);
        sort(t.begin(), t.end());
        double tmp=cost;
        //cout<<tmp<<'\n';
        for (int j=0; j<k-i; j++) tmp+=((double)t[j])/(1+i);
        //cout<<i<<' '<<tmp<<'\n';
        res=min(res, tmp);
        cost+=((double)v[i].first)/(1+i);
    }
    cout<<fixed<<setprecision(12)<<res;
}

• 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