cmp 함수 결과

#include <bits/stdc++.h>
#define endl "\n" // don't use when you cover interactive problem
#define all(v) (v).begin(), (v).end()
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
 
    priority_queue<int, vector<int>, greater<> > pq;
    pq.push(1);
    pq.push(2);
    pq.push(3);
 
    cout << pq.top() << endl; // 1이 튀어나옴
 
    return 0;
}cs

#include <bits/stdc++.h>
#define endl "\n" // don't use when you cover interactive problem
#define all(v) (v).begin(), (v).end()
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
 
    vector<int> v = {1, 2, 3};
    sort(all(v), greater<>());
    for(const auto& e: v) cout << e << ' '; // 3 2 1
 
    return 0;
}cs