Submission #1368671
Source Code Expand
#include <iostream> #include <algorithm> #include <numeric> using namespace std; int main(){ int n, k; cin >> n >> k; int w[n], p[n]; for(int i = 0; i < n; i++) cin >> w[i] >> p[i]; double l = 0, r = 100.00000001; while(1e-7 < r - l){ double a[n], mid = (l + r) / 2; for(int i = 0; i < n; i++) a[i] = w[i] * (p[i] - mid); sort(a, a + n); reverse(a, a + n); (0 <= accumulate(a, a + k, 0.) ? l : r) = mid; } cout << fixed << l << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - 食塩水 |
User | jbyxm |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 473 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s0.txt, s1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, s0.txt, s1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | AC | 3 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | AC | 3 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 3 ms | 256 KB |
005.txt | AC | 3 ms | 256 KB |
006.txt | AC | 3 ms | 256 KB |
007.txt | AC | 3 ms | 256 KB |
008.txt | AC | 3 ms | 256 KB |
009.txt | AC | 1 ms | 256 KB |
010.txt | AC | 3 ms | 256 KB |
011.txt | AC | 2 ms | 256 KB |
012.txt | AC | 3 ms | 256 KB |
013.txt | AC | 2 ms | 256 KB |
014.txt | AC | 3 ms | 256 KB |
015.txt | AC | 3 ms | 256 KB |
016.txt | AC | 3 ms | 256 KB |
017.txt | AC | 2 ms | 256 KB |
018.txt | AC | 3 ms | 256 KB |
019.txt | AC | 2 ms | 256 KB |
s0.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |