[알고리즘] 백준 2810 - 컵홀더

#include <iostream>
#include <map>
using namespace std;

int N;
int a, b;
map<char, int> M;

int main(){
    cin >> N;

    char inp;
    while(N--){
        cin >> inp;
        M[inp]++;
    }

    a = M['S'] + M['L'];
    b = M['S'] + M['L'] / 2 + 1;

    if(b <= a) cout << b << "\n";
    else cout << a << "\n";

    return 0;
}