[알고리즘] 백준 1952 - 달팽이2

#include <iostream>
using namespace std;

int main(){
    int N, M;
    
    cin >> N >> M;
    
    if(N == M){
        cout << 2 * (N - 1) << "\n";
    }
    else if(N > M) {
        cout << 2 * (M - 1) + 1 << "\n";
    }
    else {
        cout << 2 * (N - 1) << "\n";
    }
    return 0;
}