leetcode

0 class Solution {

1 public:

2 int maxCoins(vector<int> &piles) {

3 sort(piles.begin(), piles.end());

4

5 int res = 0;

6 for (int i = piles.size() / 3; i < piles.size(); i += 2) {

7 res += piles[i];

8 }

9

10 return res;

11 }

12 };