Implementing a Stack using Array

#include<iostream>

using namespace std;

//Implementing a Stack using Array -->
class Stack{
    
    public:
        int *arr;
        int top;
        int size;
        
        Stack(int capacity){
            size = capacity;
            arr = new int[size];
            top = -1;
            
        }
        
    void push(int value){
        //Check for Overflow or normal push
        if( top == size-1){
            cout << "Stack Overflow"<<endl;
        }
        top++;
        arr[top] =  value;
    }
    
    void pop(){
        //Check for underflow condition
        if(top == -1){
            cout << "Stack Underflow "<<endl;
        }
        top--;
    }
    
    int getsize(){
        return top+1;
    }
    
    bool isEmpty(){
        if(top == -1){
            //Stack is empty
            return true;
        }
        return false;
    }
    
    int getTopElement(){
        if(top == -1){
            //Empty Stack
            cout<< "Empty Stack"<<endl;
        }
        return arr[top];
    }
    
    ~Stack(){
        //Destructor to free memory
        delete[] arr;
    }
    
};

int main(){
    Stack s(5);
    
    s.push(10);
    s.push(20);
    s.push(30);
    s.push(40);
    s.push(50);
    
    s.pop();
    
    cout<<"Size of the Size :"<<s.size<<endl;
    
    cout<<s.getTopElement()<<endl;
    
}