Hello World!

https://www.acmicpc.net/problem/11000 코드#include #include #include #include using namespace std;#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);typedef pair pi;vector v;priority_queue, greater> pq;int n;int main() { FASTIO; cin >> n; v.resize(n); for (int i = 0, s, e; i > s >> e; v[i] = { s, e }; } sort(v.begin(), v.end()); pq.push(v[0].second); for (int i = 1; i = pq.top()) pq.pop();..

https://www.acmicpc.net/problem/16434코드#include #include using namespace std;#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);typedef long long ll;typedef struct { ll t; ll a; ll h; } room;vector r;ll n, h;bool simul(ll m) { ll ca = h; ll ch = m; ll tmp; for (int i = 0; i > n >> h; r = vector(n); for (int i = 0; i > r[i].t >> r[i].a >> r[i].h; ll s = 1, e = 1e18, mid, ans = 0; while (..

https://www.acmicpc.net/problem/3649 코드#include #include #include using namespace std;#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);int main() { FASTIO; int x, n; while (cin >> x >> n) { x *= 10000000; vector v(n); for (int i = 0; i > v[i]; sort(v.begin(), v.end()); int s = 0, e = n - 1, sum; bool find = false; while (s x) e--; else s++; } if (!find) cout 설명레고 두 개의 합 =..