Stack using Array

#include <iostream>

using namespace std;

class Stack{
    public:
    int *arr;
    int size;
    int top;
    
    Stack(int size){
        this ->size = size;
        arr = new int[size];
        top = -1;
    }
    
    void push(int element){
        if(size-top>=1){
            top++;
            arr[top] = element;
        }
        else{
            cout<<"Stack is full"<<endl;;
        }
    }
    void pop(){
        if(top>=0){
            top--;
        }
        else{
            cout<<"Stack Empty"<<endl;
        }
    }
    int peek(){
        if(top>=0){
        return arr[top];
    }
    else{
        cout<<"Empty";
        return -1;
    }
    }
    bool isEmpty(){
        if(top == -1){
            return true;
        }
        else{
            return false;
        }
    }
};

int main()
{
    Stack st(5);
    st.push(1);
    st.push(3);
    st.push(5);
    st.pop();
    cout<<st.peek();
    return 0;
}