c# : Easy Solution
Complexity\n- Time complexity:\nO(n)\n\n- Space complexity:\nO(1)\n\n# Code\n\npublic class Solution {\n    public int[] GetStrongest(int[] arr, int k) {\n     
# Complexity\n- Time complexity:\nO(n)\n\n- Space complexity:\nO(1)\n\n# Code\n```\npublic class Solution {\n    public int[] GetStrongest(int[] arr, int k) {\n        Array.Sort(arr);\n        var ans = new int[k];\n        var median = arr[(arr.Length - 1) / 2];\n\n        Array.Sort(arr, (a, b) => {\n            var temp1 = Math.Abs(a - median);\n            var temp2 = Math.Abs(b - median);\n            if(temp1 == temp2)\n                return b.CompareTo(a);\n            \n            return temp2.CompareTo(temp1);\n        });\n\n        for(int i = 0; i < k; i++)\n            ans[i] = arr[i];\n\n        return ans;\n    }\n}\n```
['Sorting', 'C#']