Submission #1265948

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265948		syanvu	Let's Win the Election (JOI22_ho_t3)	C++20	10 / 100	4 ms	328 KiB

Main

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>

#define SS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#pragma optimize("g", on)
#pragma GCC optimize("03")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#define int long long
#define all(x) x.begin(),x.end()
#define F first
#define S second


using namespace std;
// using namespace __gnu_pbds; 
// #define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>

const int LG = 20,N = 2e5+1,inf = 1e18,MOD = 998244353;
const double eps = 1e-9;
int T;

void solve() {
    int n,k;
    cin>>n>>k;
    int a[n+1],b[n+1];
    pair<int,int> p[n+1];
    for(int i=1;i<=n;i++){
        cin>>a[i]>>b[i];
        b[i]=(b[i]==-1 ? inf : b[i]);
        p[i]={b[i],a[i]};
    }
    sort(p+1,p+n+1, [&](pair<int,int> a,pair<int,int> b){
        if(a.F!=b.F) return a.F<b.F;
        return a.S>b.S;
    });
    for(int i=1;i<=n;i++){
        a[i]=p[i].S;
        b[i]=p[i].F;
    }

    long double ans=inf*1.0;
    long double sum=0;

    for(int c=0;c<=k;c++){
        if(c && b[c]>=inf) break;
        vector<int> v;
        if(c) sum+=(long double)b[c]/(long double)c;
        long double res=sum;

        for(int i=c+1;i<=n;i++){
            v.push_back(a[i]);
        }

        sort(all(v));

        for(int i=0;i<k-c;i++){
            res+=(long double)v[i]/(long double)(c+1);
        }
        ans=min(ans,res);
    }
    cout<<fixed<<setprecision(16)<<ans;
    return;
}
signed main() {
    //   freopen("deleg.in","r",stdin);    
    // freopen("deleg.out","w",stdout);
    SS
    int t = 1;
    if (T) {
        cin >> t;
    }
    while (t--) {
        solve();
    }
}
/*
*/

• 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