이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int N, K; cin >> N >> K;
vector<pair<ld, ld>> v(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());
ld ans = 7e18;
for(int collaborators = 0; collaborators < K; collaborators++){
ld cost = 0;
ld hv = 1;
for(int i = 0; i < collaborators; i++){
cost += v[i].first / hv;
hv++;
}
vector<ld> a;
for(int i = collaborators; i < N; i++){
a.push_back(v[i].second);
}
sort(a.begin(), a.end());
for(int i = 0; i < K - collaborators; i++){
cost += a[i] / hv;
}
ans = min(ans, cost);
}
cout << fixed << setprecision(8) << ans << "\n";
}
# | 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... |