1561. Maximum Number of Coins You Can Get mclass Solution:n    def maxCoins(self, piles: List[int]) -> int:n        pile

1561. Maximum Number of Coins You Can Get m

class Solution:n def maxCoins(self, piles: List[int]) -> int:n piles.sort(reverse = True)n return sum(piles[2*i+1] for i in range(len(piles)//3))

https://leetcode.com/problems/maximum-number-of-coins-you-can-get/discuss/806730/JavaC%2B%2BPython-Stright-Forward

class Solution:n def maxCoins(self, A):n return sum(sorted(A)[len(A) // 3::2])