1
class Solution {
2
 public:
3
  vector<int> sortEvenOdd(vector<int> &nums) {
4
    vector<int> odd, even;
5
    for (int i = 0; i < nums.size(); i++) {
6
      if (i & 1) {
7
        odd.push_back(nums[i]);
8
      } else {
9
        even.push_back(nums[i]);
10
      }
11
    }
12
    sort(odd.begin(), odd.end(), greater<int>());
13
    sort(even.begin(), even.end());
14
    for (int i = 0; i < nums.size(); i++) {
15
      if (i & 1) {
16
        nums[i] = odd[0];
17
        odd.erase(odd.begin());
18
      } else {
19
        nums[i] = even[0];
20
        even.erase(even.begin());
21
      }
22
    }
23
    return nums;
24
  }
25
};