lickelon.log

문제 링크 : boj.kr/1431난이도 : S3태그 : 정렬코드#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 sum(string &a) { int ret = 0; for(auto e : a) { if(e > n; vector arr(n); for(auto &e : arr) { cin >> e; } sort(all(arr), comp); for(auto e : arr) { co..

문제 링크 : boj.kr/14572난이도 : 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, k, d; cin >> n >> k >> d; vector>> arr(n); for(int i = 0; i > m >> arr[i].first; arr[i].se..

문제 링크 : boj.kr/3172난이도 : P4태그 : 세그먼트 트리, 정렬코드#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;bool comp(pair a, pair b) { reverse(all(a.first)); reverse(all(b.first)); return a.first class segTree {private: ll n; T id; T(*merge)(T, T); vector tree;public: s..

문제 링크 : boj.kr/4157난이도 : 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;template struct segTree { int n; T id; vector t; T(*merge)(T, T); segTree(int N, T ID, T(*_merge)(T, T)): n(N), id(ID), merge(_merge) { t.resize(N 1; p >>= 1) { if(p&1) t[p>>1] = merge(..

문제 링크 : boj.kr/12985난이도 : 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;templateclass segTree {private: ll n; T id; T(*merge)(T, T); vector tree;public: segTree(ll n, T id, T(*merge)(T, T)) { this->n = n; this->id = id; th..

문제 링크 : boj.kr/10165난이도 : 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;struct route { ll s; ll e; int idx; route(ll _s, ll _e, int _idx) : s(_s), e(_e), idx(_idx) {}};bool comp(route &a, route &b) { if(a.s == b.s) return a.e > b.e; return a.s ..

문제 링크 : http://boj.kr/1744난이도 : G4태그 : 그리디, 정렬코드#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; deque neg, pos; int ans = 0; for(int i = 0; i > input; if(input == 1) ans += ..

문제 링크 : boj.kr/2437난이도 : G2태그 : 그리디, 정렬코드#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; vector arr(n); for(auto &u : arr) cin >> u; sort(all(arr)); int sum = 0; for(auto u :..

문제 링크 : boj.kr/1911난이도 : G5태그 : 그리디, 정렬코드#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, l; cin >> n >> l; vector arr(n); for(auto &u : arr) cin >> u.first >> u.second; sort(all(arr)); in..

문제 링크 : boj.kr/2285난이도 : G4태그 : 그리디, 정렬코드#include #define all(x) (x).begin(), (x).end()#define INF 987654321#define int long longusing namespace std;using ld = long double;using pii = pair;template istream& operator>>(istream & ist, pair &p) { ist >> p.first >> p.second; return ist;}template istream& operator>>(istream & ist, vector &arr) { for(auto &u : arr) ist >> u; return ist;}in..