Algorithm/boj10828.cpp at master · mj-sep/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include<iostream>
#include<stack>
using namespace std;

stack<int> s;

// push
void push(int x) {
    s.push(x);
}

// push 제외한 명령어
void f_stack(string x) {
    if (x == "top") {
        if (s.empty()) cout << "-1\n";
        else cout << s.top() << "\n";
    }
    else if (x == "pop") {
        if (s.empty()) cout << "-1\n";
        else {
            cout << s.top();
            s.pop();
            cout << "\n";
        }
    }
    else if (x == "empty") {
        if (s.empty()) cout << "1\n";
        else cout << "0\n";
    }
    else if (x == "size") {
        cout << s.size() << "\n";
    }
}


int main() {
    int n;
    cin >> n; // 주어지는 명령의 수

    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;

        if (s == "push") {
            int n;
            cin >> n;
            push(n);
        }
        else {
            f_stack(s);
        }

    }
}