#LCP 33 蓄水

int storeWater(int* bucket, int bucketSize, int* vat, int vatSize){
    int max = vat[0];
    int i;
    int min = 0;
    for(i = 1; i<vatSize; ++i)
    {
        if(vat[i] > max) max = vat[i];
    }
    for(i = 1; i<=max; ++i)
    {
        int j;
        int currRes = i;
        for(j = 0; j<bucketSize; ++j)
        {
            int single = vat[j] / i;
            if(i * single < vat[j])
            {
                single++;
            }
            if(bucket[j] < single)
            {
                currRes += (single - bucket[j]);
            }
        }
        if(i == 1) min = currRes;
        if(currRes < min) min = currRes;
    }
    return min;
}