Problem p02683 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvec;
typedef vector<vector<bool>> vveb;
typedef vector<vector<string>> vves;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define rev(v) reverse(v.begin(), v.end())
#define fs first
#define sc second
#define pb push_back
#define pp pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
// const int64 INF = 1LL << 58;
#define dame                                                                   \\
  {                                                                            \\
    puts("-1");                                                                \\
    return 0;                                                                  \\
  }
#define YES                                                                    \\
  {                                                                            \\
    cout << "YES" << endl;                                                     \\
    return 0;                                                                  \\
  }
#define NO                                                                     \\
  {                                                                            \\
    cout << "NO" << endl;                                                      \\
    return 0;                                                                  \\
  }
#define Yes                                                                    \\
  {                                                                            \\
    cout << "Yes" << endl;                                                     \\
    return 0;                                                                  \\
  }
#define No                                                                     \\
  {                                                                            \\
    cout << "No" << endl;                                                      \\
    return 0;                                                                  \\
  }
#define uniq(a)                                                                \\
  sort(all(a));                                                                \\
  (a).resize(unique(all(a)) - a.begin());
#define dab(v)                                                                 \\
  for (auto i : v)                                                             \\
    cout << i << ' ';                                                          \\
  cout << endl;
#define vin(v)                                                                 \\
  for (ll i = 0; i < v.size(); ++i)                                            \\
    cin >> v[i];
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int gcd(int a, int b) {
  if (a % b == 0) {
    return (b);
  } else {
    return (gcd(b, a % b));
  }
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  // cout << fixed << setprecision(15);

  int N, M, X;
  cin >> N >> M >> X;
  vi C(N);
  vvi A(N, vi(M));
  // 一旦INFに設定して小さくしていく
  int minimum = INF;
  rep(i, N) {
    cin >> C.at(i);
    rep(j, M) { cin >> A.at(i).at(j); }
  }

  // {0, 1, ..., n-1} の部分集合の全探索
  for (int bit = 0; bit < (1 << N); ++bit) {
    vi skill(M, 0);
    bool flag = true;
    vector<int> S;
    for (int i = 0; i < N; ++i) {
      if (bit & (1 << i)) { // 列挙に i が含まれるか
        S.push_back(i);
      }
    }
    for (int i = 0; i < (int)S.size(); ++i) {
      for (int j = 0; j < M; ++j) {
        skill.at(j) += A.at(S.at(i)).at(j);
      }
    }
    for (int i = 0; i < M; ++i) {
      if (skill.at(i) < X)
        flag = false;
      // cout << skill.at(i) << " ";
    }
    if (flag == true) {
      int temp = 0;
      rep(i, (int)S.size()) { temp += C.at(S.at(i)); }
      if (minimum > temp)
        minimum = temp;
      // cout <<temp << " ";
    }
    // cout << minimum << endl;
  }
  if (minimum == INF) {
    cout << -1;
    return 0;
  } else {
    cout << minimum;
  }
  return 0;
}


Error: WA

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvec;
typedef vector<vector<bool>> vveb;
typedef vector<vector<string>> vves;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define rev(v) reverse(v.begin(), v.end())
#define fs first
#define sc second
#define pb push_back
#define pp pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
// const int64 INF = 1LL << 58;
#define dame                                                                   \\
  {                                                                            \\
    puts("-1");                                                                \\
    return 0;                                                                  \\
  }
#define YES                                                                    \\
  {                                                                            \\
    cout << "YES" << endl;                                                     \\
    return 0;                                                                  \\
  }
#define NO                                                                     \\
  {                                                                            \\
    cout << "NO" << endl;                                                      \\
    return 0;                                                                  \\
  }
#define Yes                                                                    \\
  {                                                                            \\
    cout << "Yes" << endl;                                                     \\
    return 0;                                                                  \\
  }
#define No                                                                     \\
  {                                                                            \\
    cout << "No" << endl;                                                      \\
    return 0;                                                                  \\
  }
#define uniq(a)                                                                \\
  sort(all(a));                                                                \\
  (a).resize(unique(all(a)) - a.begin());
#define dab(v)                                                                 \\
  for (auto i : v)                                                             \\
    cout << i << ' ';                                                          \\
  cout << endl;
#define vin(v)                                                                 \\
  for (ll i = 0; i < v.size(); ++i)                                            \\
    cin >> v[i];
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int gcd(int a, int b) {
  if (a % b == 0) {
    return (b);
  } else {
    return (gcd(b, a % b));
  }
}

long long int value(long long int x, long long int A, long long int B) {
  return floor(A * x / B) - A * floor(x / B);
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  // cout << fixed << setprecision(15);

  int N, M, X;
  cin >> N >> M >> X;
  vi C(N);
  vvi A(N, vi(M));
  // 一旦INFに設定して小さくしていく
  int minimum = INF;
  vi skill(M, 0);
  rep(i, N) {
    cin >> C.at(i);
    rep(j, M) { cin >> A.at(i).at(j); }
  }

  // {0, 1, ..., n-1} の部分集合の全探索
  for (int bit = 0; bit < (1 << N); ++bit) {
    bool flag = true;
    vector<int> S;
    for (int i = 0; i < N; ++i) {
      if (bit & (1 << i)) { // 列挙に i が含まれるか
        S.push_back(i);
      }
    }
    for (int i = 0; i < (int)S.size(); ++i) {
      for (int j = 0; j < M; ++j) {
        skill.at(j) += A.at(i).at(j);
      }
    }
    for (int i = 0; i < (int)S.size(); ++i) {
      if (skill.at(i) > X)
        flag = false;
    }
    if (flag == true && minimum < acc(all(C), 0))
      minimum = acc(all(C), 0);
  }
  if (minimum == INF) {
    cout << -1;
    return 0;
  } else {
    cout << minimum;
  }
  return 0;
}