leetcode

0 class Solution {

1 public:

2 vector<int> advantageCount(vector<int> &nums1, vector<int> &nums2) {

3 static int indices[100001];

4 const int n = size(nums1);

5

6 sort(begin(nums1), end(nums1), greater<int>());

7

8 iota(indices, indices + n, 0);

9 sort(indices, indices + n, [&nums2](int a, int b) { return nums2[a] > nums2[b]; });

10

11 int i = 0, j = 0, k = n - 1;

12 vector<int> res(n);

13

14 while (i <= k) {

15 if (nums1[i] > nums2[indices[j]])

16 res[indices[j++]] = nums1[i++];

17 else

18 res[indices[j++]] = nums1[k--];

19 }

20

21 return res;

22 }

23 };