이야기

https://www.acmicpc.net/problem/1931정렬의 조건문을 잘 설정해야 하는 문제이다.#include #include #include #include using namespace std;int main() { std::vector > v; int N; cin >> N; for (int i = 0; i > first >> second; v.emplace_back(make_pair(first,second)); } std::sort(v.begin(), v.end(), [](std::pair l, std::pair r) { if (l.second == r.second) { if (l.first == l.second) return false; else if (r.first =..

https://www.acmicpc.net/problem/1744#include #include using namespace std;int main() { cin.tie(0)->sync_with_stdio(false); priority_queue> pq; priority_queue, greater> nq; int N; cin >> N; int sum = 0; for (int i = 0; i > tmp; if (tmp > 1) pq.push(tmp); else if (tmp 1) { int mul = nq.top(); nq.pop(); mul *= nq.top(); nq.pop(); sum += mul; } if (nq.size() == 1) sum += nq.top(); while (..