View difference between Paste ID: Z8V0avnG and PPvxKUqm

 #include<iostream>
 #include<map>
 #include<vector>
 #include<stack>
 #include<algorithm>
 #include<cmath>
 #include<set>
 #include<iomanip>
 #include<fstream>
 
 using namespace std;
 
 ifstream in("frog.in");
 ofstream out("frog.out");
 
 bool check(vector<pair<long long, long long>> &v, long long w, long long h, long double k) {
-    int n;
+    long double x = 0;
-    in >> n;
+    long double y = 0;
-    vector<int> v(n);
+    long double wi = 0, hi = 0;
-    for(int i = 0; i < n; i++) {
+    long long prev_h = -1;
-        in >> v[i];
+    int last = -1;
 
-    long long energy = 0;
+    for(int i = 0; i < v.size(); i++) {
-    int shift = 0;
+        wi = v[i].first * k;
-    int prev_shift = 0;
+        hi = v[i].second * k;
-    int prev = -1;
+        if(prev_h == v[i].second) {
-    int p = n - 1;
+            if(x + wi <= w)
-    while(p >= 0) {
+                x += wi;
-        if(v[p] != prev)
+            else {
-            energy += max(v[p] - shift, 0);
+                x = 0;
                 y += hi;
-            energy += max(v[p] - prev_shift, 0);
+            }
             last = 1;
-        prev_shift = shift;
+        }
-        shift++;
+        else {
-        prev = v[p];
+            x = wi;
-        p--;
+            y += hi;
             last = 2;
         }
-    out << energy << endl;
+
         prev_h = v[i].second;
     }
 
     return x <= w && y <= h;
 }
 
 int main() {
     long long n, w, h;
     cin >> n >> w >> h;
 
     vector<pair<long long, long long>> v(n);
     for(int i = 0; i < n; i++)
         cin >> v[i].first >> v[i].second;
 
     long double l = 0, r = 1e9;
     for(int k = 0; k < 100; k++) {
         long double m = (l + r) / 2.0;
 
         if(check(v, w, h, m))
             l = m;
         else
             r = m;
     }
 
     cout.precision(100);
     cout << l << endl;
 
     return 0;
 }