-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA_Helmets_in_Night_Light.cpp
55 lines (43 loc) · 1.27 KB
/
A_Helmets_in_Night_Light.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <bits/stdc++.h>
#define int long long
#define ab adityabelgaonkar
using namespace std;
bool customComp(pair<int, int> a, pair<int, int> b)
{
if(a.first == b.first) return a.second > b.second;
return a.first < b.first;
}
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int t; cin >> t;
while(t--)
{
int n, p; cin >> n >> p;
vector<pair<int, int>> a(n);
for(auto &i : a) cin >> i.second;
for(auto &i : a) cin >> i.first;
sort(a.begin(), a.end(), customComp);
//i.second is number of people we can tell for cost of i.first
// for(auto &i : a) cout << i.second << ' '; cout << '\n';
// for(auto &i : a) cout << i.first << ' '; cout << '\n';
int ans = p;
int unlocked = 1;
for(int i = 0; i < n; ++i)
{
if(a[i].first > p || unlocked >= n) break;
if(n - unlocked < a[i].second)
{
ans += a[i].first * (n - unlocked);
}
else
{
ans += a[i].first * a[i].second;
}
unlocked += a[i].second;
}
ans += p * max(0ll, n - unlocked);
cout << ans << '\n';
}
return 0;
}