Problem p03107 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, n - 1)
#define NREP(i, n) FOR(i, 1, n)
using ll = long long;
using pii = pair<int, int>;
using piii = pair<pii, pii>;
const int dx[4] = {0, -1, 1, 0};
const int dy[4] = {-1, 0, 0, 1};
const int INF = 1e9 + 7;
int gcd(int x, int y) {
  if (x < y)
    swap(x, y);
  if (y == 0)
    return x;
  return gcd(y, x % y);
}

template <class T1, class T2> void chmin(T1 &a, T2 b) {
  if (a > b)
    a = b;
}

template <class T1, class T2> void chmax(T1 &a, T2 b) {
  if (a < b)
    a = b;
}
template <class T> void Add(T &a, const T &b, const T &mod = 1000000007) {
  int val = ((a % mod) + (b % mod)) % mod;
  if (val < 0) {
    val += mod;
  }
  a = val;
}
////////////////////////////////////////
int main() {
  string S;
  int count = 0;
  cin >> S;
  vector<int> V;
  for (int i = 0; i < S.size(); ++i) {
    if (S[i] == '0') {
      V.push_back(0);
    } else {
      V.push_back(1);
    }
  }
  while (true) {
    bool can = false;
    if (V.size() == 1)
      break;
    for (int i = 0; i < V.size() - 1; ++i) {
      if (V[i] != V[i + 1]) {
        can = true;
        V.erase(V.begin() + i + 1);
        V.erase(V.begin() + i);
        count += 2;
        break;
      }
    }
    if (!can)
      break;
  }
  cout << count << endl;
  return 0;
}


Fixed submission:
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define REP(i, n) FOR(i, 0, n - 1)
#define NREP(i, n) FOR(i, 1, n)
using ll = long long;
using pii = pair<int, int>;
using piii = pair<pii, pii>;
const int dx[4] = {0, -1, 1, 0};
const int dy[4] = {-1, 0, 0, 1};
const int INF = 1e9 + 7;
int gcd(int x, int y) {
  if (x < y)
    swap(x, y);
  if (y == 0)
    return x;
  return gcd(y, x % y);
}

template <class T1, class T2> void chmin(T1 &a, T2 b) {
  if (a > b)
    a = b;
}

template <class T1, class T2> void chmax(T1 &a, T2 b) {
  if (a < b)
    a = b;
}
template <class T> void Add(T &a, const T &b, const T &mod = 1000000007) {
  int val = ((a % mod) + (b % mod)) % mod;
  if (val < 0) {
    val += mod;
  }
  a = val;
}
////////////////////////////////////////
int main() {
  string S;
  int count = 0;
  cin >> S;
  vector<int> V;
  for (int i = 0; i < S.size(); ++i) {
    if (S[i] == '0') {
      V.push_back(0);
    } else {
      V.push_back(1);
    }
  }
  while (true) {
    bool can = false;
    if (V.size() == 0)
      break;
    for (int i = 0; i < V.size() - 1; ++i) {
      if (V[i] != V[i + 1]) {
        can = true;
        V.erase(V.begin() + i + 1);
        V.erase(V.begin() + i);
        count += 2;
        break;
      }
    }
    if (!can)
      break;
  }
  cout << count << endl;
  return 0;
}