wolves/leetcode
1
0
Fork 0
mirror of https://github.com/lWolvesl/leetcode.git synced 2026-01-13 02:38:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

routine

Browse Source
This commit is contained in:
wolves
2025-12-28 12:04:25 +08:00
parent c0efe232d6
commit 5297b42c6e
4 changed files with 62 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
25/12/comp/28q2.cpp Normal file
View File

@@ -0,0 +1,15 @@
#include <algorithm>
class Solution {
public:
long long minimumCost(int cost1, int cost2, int costBoth, int need1, int need2) {
if (costBoth >= cost1 + cost2) {
return (long long)cost1 * need1 + (long long)cost2 * need2;
}
int m1 = std::min(need1,need2);
long long a2 = (long long)std::max(need1,need2) * costBoth;
long long ans = (long long)m1 * costBoth;
ans += (long long)(need1 - m1) * cost1;
ans += (long long)(need2 - m1) * cost2;
return std::min(ans,a2);
}
};