题目:
代码:
int cmp(const void *a, const void *b){
return *(int*)a - *(int*)b;
}
int maxIceCream(int* costs, int costsSize, int coins){
qsort(costs, costsSize, sizeof(int), cmp);
int count = 0;
for(int i = 0; i < costsSize; i++){
int cost = costs[i];
if(coins >= cost){
coins -= cost;
count++;
}
else{
break;
}
}
return count;
}
解题思路:
排序 贪心