1
class Solution {
2
 public:
3
  vector<int> getStrongest(vector<int> &arr, int k) {
4
    int n = arr.size();
5
    sort(arr.begin(), arr.end());
6
    int m = arr[(n - 1) / 2];
7
    priority_queue<pair<int, int>> pq;
8
    for (auto it : arr) {
9
      pq.push({abs(it - m), it});
10
    }
11
    vector<int> ans;
12
    while (k-- && !pq.empty()) {
13
      ans.push_back(pq.top().second);
14
      pq.pop();
15
    }
16
    return ans;
17
  }
18
};