Building a Binary Heap & Priority Queue in C++20

#include <iostream>
#include <vector>
#include <algorithm>

class MinHeap {
    std::vector<int> heap;
public:
    void push(int val) {
        heap.push_back(val);
        std::push_heap(heap.begin(), heap.end(), std::greater<int>());
    }
    int pop() {
        std::pop_heap(heap.begin(), heap.end(), std::greater<int>());
        int minVal = heap.back();
        heap.pop_back();
        return minVal;
    }
};

int main() {
    MinHeap h;
    h.push(40);
    h.push(10);
    h.push(30);
    std::cout << "Min Element: " << h.pop() << std::endl;
    return 0;
}