fork download
copy 
  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> boxes;
  30. vector<int> unitPerBox;
  31.  
  32. int consistency(int n, int t) {
  33.  
  34. 	vector<pair<int,int>> p;
  35. 	for(int i=0; i<n; i++){
  36. 		p.push_back({unitPerBox[i], boxes[i]});
  37. 	}
  38.  
  39. 	sort(begin(p), end(p), greater<pair<int,int>>());
  40.  
  41. 	int ans = 0;
  42. 	for(int i=0; i<n; i++){
  43. 		int unit = p[i].first;
  44. 		int box = p[i].second;
  45.  
  46. 		int k = min(box, t);
  47.  
  48. 		ans += k*unit;
  49. 		t -= k;
  50.  
  51. 	}
  52.  
  53. 	return ans;
  54.  
  55. }
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69. // boxes[]
  70. // unitPerBox[]
  71.  
  72. int practice(int n, int t) {
  73.  
  74. 	return 0;
  75. }
  76.  
  77.  
  78. void solve() {
  79.  
  80. 	int n, t;
  81. 	cin >> n >> t;
  82.  
  83. 	boxes.resize(n);
  84. 	unitPerBox.resize(n);
  85. 	for(int i=0; i<n; i++) cin >> boxes[i];
  86. 	for(int i=0; i<n; i++) cin >> unitPerBox[i];
  87.  
  88.     cout << consistency(n, t)  << endl;
  89.     // cout << consistency(n, t) << " -> " << practice(n, t) << endl;
  90.  
  91. }
  92.  
  93.  
  94.  
  95.  
  96.  
  97. int32_t main() {
  98.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  99.  
  100.     int t = 1;
  101.     cin >> t;
  102.     while (t--) {
  103.         solve();
  104.     }
  105.  
  106.     return 0;
  107. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
2
3 3
1 2 3
3 2 1
3 6
3 1 6
2 7 4
stdout
copy 
7
27
https://ideone.com/EuxdRm
language:
C++14 (gcc 8.3)
created:
6 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!