LCP 06.拿硬币 (Easy)*

class Solution {
public:
    int minCount(vector<int>& coins) {
        int len = coins.size();
        if(len == 0) {
            return 0;
        }
        int res = 0;
        for(auto coin : coins) {
            res += (coin + 1) / 2 ;
        }
        return res;
    }
};