独树一帜的做法

请问各位大佬这个算法的复杂度是多少？谢谢

#include<queue>
#include<cstdio>
#include<vector>
int x;
std::priority_queue<int,std::vector<int>,std::greater<int>> heap;
signed main(){
    scanf("%d",&x);
    heap.push(x);
    scanf("%d",&x);
    heap.push(x);
    scanf("%d",&x);
    heap.push(x);
    printf("%d ",heap.top());
    heap.pop();
    printf("%d ",heap.top());
    heap.pop();
    printf("%d ",heap.top());
    heap.pop();
    return 0;
}