-
Notifications
You must be signed in to change notification settings - Fork 3
/
2499.cpp
39 lines (38 loc) · 1.15 KB
/
2499.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
class Solution {
public:
long long minimumTotalCost(vector<int>& nums1, vector<int>& nums2) {
long long ans = 0;
vector<int> counts(100005, 0);
int dominantCnt = 0;
int dominantNum = -1;
int involvedCnt = 0;
int n = nums1.size();
for (int i = 0; i < n; ++i) {
if (nums1[i] == nums2[i]) {
ans += i;
counts[nums1[i]]++;
if (counts[nums1[i]] > dominantCnt) {
dominantCnt = counts[nums1[i]];
dominantNum = nums1[i];
}
involvedCnt++;
}
}
if (dominantCnt > involvedCnt / 2) {
for (int i = 0; i < n; ++i) {
if (nums1[i] != nums2[i] && nums1[i] != dominantNum && nums2[i] != dominantNum) {
counts[nums1[i]]++;
involvedCnt++;
ans += i;
if (dominantCnt <= involvedCnt / 2) {
return ans;
}
}
}
return -1;
}
else {
return ans;
}
}
};