fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b) {
  14. int x = 1;
  15. a %= M;
  16. while (b) {
  17. if (b & 1) x = (x * a) % M;
  18. a = (a * a) % M;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29. vector<int> a; //* Val
  30. vector<int> b; //* Wg
  31.  
  32. double consistency(int n, int x){
  33.  
  34. vector<pair<int,int>> p;
  35. for(int i=0; i<n; i++){
  36. p.push_back({a[i], b[i]});
  37. }
  38.  
  39. //* Sort by V/W basis decreasing order
  40. sort(begin(p), end(p), [](const pair<int,int>& a, const pair<int,int>& b){
  41. return a.first * b.second > b.first * a.second;
  42. });
  43.  
  44.  
  45. double ans = 0;
  46.  
  47. for(int i=0; i<n; i++){
  48. double v = p[i].first;
  49. double w = p[i].second;
  50. double rem = w;
  51.  
  52. if(x-w < 0){
  53. rem = x;
  54. }
  55.  
  56. v = (rem/w) * v;
  57. x -= rem;
  58. ans += v;
  59. }
  60.  
  61.  
  62.  
  63. return ans;
  64. }
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80. double practice(int n, int x){
  81.  
  82.  
  83. return 0;
  84. }
  85.  
  86.  
  87.  
  88.  
  89.  
  90. void solve() {
  91.  
  92. int n, x;
  93. cin>> n >> x;
  94.  
  95. a.resize(n);
  96. b.resize(n);
  97. for(int i=0; i<n; i++) cin >> a[i];
  98. for(int i=0; i<n; i++) cin >> b[i];
  99.  
  100. cout << fixed << setprecision(7) << consistency(n, x) << endl;
  101.  
  102.  
  103. }
  104.  
  105.  
  106.  
  107.  
  108.  
  109. int32_t main() {
  110. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  111.  
  112. int t = 1;
  113. // cin >> t;
  114. while (t--) {
  115. solve();
  116. }
  117.  
  118. return 0;
  119. }
Success #stdin #stdout 0s 5324KB
stdin
3 50
60 100 120
10 20 30
stdout
240.0000000