# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991636 | Otalp | Let's Win the Election (JOI22_ho_t3) | C++14 | 15 ms | 2648 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define pii pair<int, int>
#define ff first
#define ss second
#define ld long double
#define pb push_back
pair<ld, ld> a[300100];
ll b[300100];
ll n, m;
bool cmp(int x, int y){
return a[x].ss < a[y].ss;
}
void solve(){
cin>>n>>m;
int cnt = 0;
vector<int> q;
for(int i=1; i<=n; i++){
cin>>a[i].ff>>a[i].ss;
if(a[i].ss == -1) a[i].ss = 1e9;
else cnt ++, q.pb(i);
}
sort(q.begin(), q.end(), cmp);
sort(a + 1, a + 1 + n);
ld ans = 1e18;
for(int d=0; d<=cnt; d++){
ld res = 0;
map<int, int> us;
for(int i=0; i<d; i++){
us[q[i]] = 1;
res += a[q[i]].ss / (i + 1);
}
for(int i=1; us.size() < m; i++){
if(!us[i]) res += a[i].ff / (d + 1), us[i] = 1;
}
//cout<<d<<' '<<res<<'\n';
ans = min(ans, res);
}
cout<<fixed<<setprecision(9)<<ans<<'\n';
}
signed main(){
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |