SRM476 Div1 Easy

250
全部試す。

class Badgers {
public:
  int feedMost(vector <int> H, vector <int> G, int total)
  {
    const int size = H.size();

    int ret = 0;

    for (int i = 0; i < size; ++i) {
      vector<int> v;
      for (int j = 0; j < size; ++j) {
        v.push_back(H[j] + G[j] * i);
      }
      sort(v.begin(), v.end());
      if (accumulate(v.begin(), v.begin() + i + 1, 0) <= total) {
        ret = max(ret, i + 1);
      }
    }

    return ret;
  }

};