제출 #1141536

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1141536		ackhava	Let's Win the Election (JOI22_ho_t3)	C++20	10 / 100	1 ms	328 KiB

Main

#include <bits/stdc++.h>
#define REP(v, i, j) for (int v = i; v != j; v++)
#define FORI(v) for (auto i : v)
#define FORJ(v) for (auto j : v)

#define OUT(v, a) \
    FORI(v)       \
    cout << i << a;
#define OUTS(v, a, b)      \
    cout << v.size() << a; \
    OUT(v, b)
#define in(a, n) \
    REP(i, 0, n) \
    cin >> a[i];

#define SORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define MEMSET(m) memset(m, -1, sizeof m)

#define pb push_back
#define fi first
#define se second

#define detachIO                      \
    ios_base::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0);
    
using namespace std;

template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
bool operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
    if(__x.size() != __y.size()) return false;
    return std::equal(__x.begin(), __x.end(), __y.begin());
}


typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<pii, pii> piiii;

const int MOD = 1e9+7;

struct modint {
    long long val;

    modint() = default;
    modint(int _val): val(_val){}
    modint operator+(modint b){ return ((this->val + b.val)%MOD); }
    modint operator-(modint b){ return ((MOD + this->val - b.val)%MOD); }
    modint operator*(modint b){ return ((this->val * b.val)%MOD); }
    modint operator^(int a){
        if(a==0)return 1;
        if(a==1)return *this;
        return (((*this)*(*this))^(a>>1))*((*this)^(a&1)); 
    }
};

modint invert(modint a){
    return a^(MOD-2);
}

modint operator/(modint a, modint b){
    return a*invert(b);
}

vector<pii> vec;

int main(){
    detachIO;
    int n;cin>>n;
    int k;cin>>k;
    multiset<pii> ms;
    multiset<pii> bs;
    REP(i,0,n){
        int a,b;cin>>a>>b;
        vec.pb({a,b});
        if(a==b)bs.insert({a,i});
        ms.insert({a,i});
    }
    double ans=2e20;
    double cur=0;
    double ext=0;
    while(ms.size()>k)ms.erase(*ms.rbegin());
    FORI(ms)cur+=i.fi;
    ans=cur;
    
    REP(i,1,k+1){
        if(!bs.size())break;
        ext+=bs.begin()->fi*1.0/i;
        cerr<<bs.begin()->fi<<' ';
        if(ms.count(*bs.begin()))cur-=bs.begin()->fi;
        ms.erase(*bs.begin());
        bs.erase(*bs.begin());
        while(ms.size()>(k-i))cur-=ms.rbegin()->fi,ms.erase(*ms.rbegin());
        ans=min(ans,cur*1.0/(i+1) + ext);
    }

    cout<<fixed<<setprecision(20)<<ans<<'\n';
}

• 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