[백준/그리디/C++] 1439번 뒤집기

문제는 여기!

#include <bits/stdc++.h>

using namespace std;

string s;
int zero = 0, one = 0;

void input(){
    cin >> s;
    char tmp = '2';
    for(char c : s){
        if(tmp!=c){
            if(c=='0') zero++;
            else one++;
        }
        tmp = c;
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    input();
    cout << min(zero, one);

    return 0;
}