[프로그래머스]양꼬치

int solution(int n, int k) {
    int sheep = 12000;
    int drink = 2000;
    int answer = 0;
    
    if (n % 10 == 0) {
        int tem;
        tem = n / 10;
        k = k-tem;
        answer = (n*sheep)+(k*drink);
    } else if (n >=10 ){
        int tem2;
        tem2 = n / 10;
        k = k-tem2;
        answer = (n*sheep)+(k*drink);
    } else {
        answer = (n*sheep)+(k*drink);
    }
    return answer;
}