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>
typedef long double ld;
#define fastio cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
using namespace std;
#define F first
#define S second
int main(){
//fastio
const int big = 1e6;
int n, k;
ld ans = big;
cin >> n >> k;
vector<pair<int, int>> ba(n);
for(int i=0; i<n; i++){
cin >> ba[i].S >> ba[i].F;
ba[i].S = -ba[i].S;
if(ba[i].F==-1) ba[i].F = big;
}
sort(ba.begin(), ba.end());
for(int i=0; i<=k; i++){
if(i && ba[i-1].F==big) break;
ld tmp = 0;
for(int j=0; j<i; j++)
tmp += ((ld)ba[j].F)/(1+j);
vector<int> rem(n-i);
for(int j=i; j<n; j++) rem[j-i] = -ba[j].S;
sort(rem.begin(), rem.end());
int hr = 0;
for(int j=0; j<k-i; j++) hr += rem[j];
tmp += ((ld)hr)/(1+i);
ans = min(ans, tmp);
}
cout << fixed << setprecision(6) << ans << '\n';
return 0;
}
# | 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... |