문제 링크 : boj.kr/23578난이도 : P5태그 : 그리디, 우선순위 큐코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; if(n == 1) { cout ve(n); ll ans = 0; priority_queue, greater> _pq; for(int ..