Highly optimized & easiest C++ solution using two pointer
\nclass Solution {\npublic:\n    vector<int> getStrongest(vector<int>& arr, int k) {\n      sort(arr.begin(),arr.end());\n      int i = 0 , j = arr.size()-1;\n 
```\nclass Solution {\npublic:\n    vector<int> getStrongest(vector<int>& arr, int k) {\n      sort(arr.begin(),arr.end());\n      int i = 0 , j = arr.size()-1;\n      int median = arr[(arr.size()-1)/2];\n        while(--k >= 0){\n            if(median - arr[i] > arr[j] - median)\n                i++;\n            else j--;\n        }\n        arr.erase(arr.begin()+i , arr.begin()+j+1);\n        return arr;\n    }\n};\n```
['C']