백준 13413번 C++ 풀이

#include <iostream>
#include <climits>
#include <cstring>
#include <queue>
#include <algorithm>
#include <map>
#include <list>
#include <stack>

using namespace std;

bool buffer[100][100];

int answer(bool origin[], bool goal[], int n) {
int white = 0;
int black = 0;
for (auto i=0; i<n; i++) {
if (origin[i] != goal[i]) {
if (origin[i]) {
white++;
} else {
black++;
}
}
}
return max(white, black);
}

int main() {
ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

int t;
cin >> t;
while (t--) {
int n;
cin >> n;

bool origin[n];
bool goal[n];

for (auto i=0; i<n; i++) {
char temp;
cin >> temp;
origin[i] = temp == 'W';
}

for (auto i=0; i<n; i++) {
char temp;
cin >> temp;
goal[i] = temp == 'W';
}
cout << answer(origin, goal, n) << '\n';
}
return 0;
}