### Question

Given two arrays A and B of equal size, the advantage of A with respect to B is the number of indices i for which A[i] > B[i].

Return any permutation of A that maximizes its advantage with respect to B.

### Example 1

Input: A = [2,7,11,15], B = [1,10,4,11]
Output: [2,11,7,15]

### Example 2

Input: A = [12,24,8,32], B = [13,25,32,11]
Output: [24,32,8,12]

Note:

1. 1 <= A.length = B.length <= 10000
2. 0 <= A[i] <= 10^9
3. 0 <= B[i] <= 10^9

### Solution

// 思路：将A排序，对于B的每个元素，在A中寻找最小的higher值，如果不存在这个值，给一个最小值
class Solution {
public:
vector<int> advantageCount(vector<int>& A, vector<int>& B) {
vector<int> isvisited;
isvisited.resize(A.size(), false);
sort(A.begin(), A.end());
vector<int> res;
for (int i = 0; i < B.size(); i++) {
bool success = false;
int index = -1;
for (int j = 0; j < A.size(); j++) {
if (!isvisited[j]) {
if (A[j] > B[i]) {
success = true;
res.push_back(A[j]);
isvisited[j] = true;
break;
} else {
if (index == -1) index = j;
}
}
}
if (!success) {
isvisited[index] = true;
res.push_back(A[index]);
}
}
return res;
}
};