How does the stack work?

Question

C++ / C#

I did not quite understand how the stack works in this code:

class Stack
{
  static const int MAX = 10;
  int st[MAX];
  int top;
public:
  Stack():top(0){}
  void push(int var)
  {
    st[++top] = var;
  }
  int pop()
  {
    return st[top--];
  }
};
int main()
{
  setlocale(0, "");
  Stack s1;
  s1.push(11);
  s1.push(22);
  cout << "1: " << s1.pop() << endl;
  cout << "2: " << s1.pop() << endl;
  s1.push(33);
  s1.push(44);
  s1.push(55);
  s1.push(66);
  cout << "3: " << s1.pop() << endl;
  cout << "4: " << s1.pop() << endl;
  cout << "5: " << s1.pop() << endl;
  cout << "6: " << s1.pop() << endl;
  getch();
  return 0;
}

Why is the conclusion like this?

1: 22
2: 11
3: 66
4: 55
5: 44
6: 33

Answer 1

Last in, first out.
If you stack 1 sheet and then pick up 1 sheet at a time, you will take the one that is on top (i.e. the one that was put last).

Answer 2

the stack works like a magazine for a Kalashnikov assault rifle.
and AK itself is a stack-to-queue converter