func_code_string: #include <bits/stdc++.h>   using namespace std;   void doicho(int &t1, int &t2) {     if (t1 > t2) swap(t1, t2);   }   void sapxep(pair<double, int> result[], int n) {     for (int i = 0; i < n - 1; i++) {       for (int j = i + 1; j < n; j++) {         if (result[i].first < result[j].first) {           swap(result[i].first, result[j].first);           swap(result[i].second, result[j].second);         } else if (result[i].first == result[j].first &&                    result[i].second > result[j].second) {           swap(result[i].first, result[j].first);           swap(result[i].second, result[j].second);         }       }     }   }   int main() {     int n, t1, t2, k;     cin >> n >> t1 >> t2 >> k;     int a[n], b[n];     for (int i = 0; i < n; i++) cin >> a[i] >> b[i];     pair<double, int> result[n];     for (int i = 0; i < n; i++) {       double x, y, z, t;       x = (a[i] * t1 - t1 * a[i] * ((double)k / 100) + b[i] * t2);       t = (a[i] * t2 - t1 * b[i] * ((double)k / 100) + b[i] * t1);       double max2 = x > t ? x : t;       result[i].first = max2;       result[i].second = i + 1;     }     sapxep(result, n);     for (int i = 0; i < n; i++)       printf( %d %.2f n , result[i].second, result[i].first);   }   