lickelon.log

문제 링크 : 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/2812난이도 : G3태그 : 그리디, 스택코드#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; cin >> n >> k; string s; cin >> s; stack _st; for(auto u : s) { while(k > 0 && !_st.empt..

문제 링크 : 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..

문제 링크 : boj.kr/14798난이도 : 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 T; cin >> T; for(int t = 1; t > r >> c; vector board(r); for(auto &u : board) cin >> u; ..

문제 링크 : boj.kr/1464난이도 : 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); string s; cin >> s; string ans = ""; ans = ans + s[0]; for(int i = 1; i = s[i]) { ans = s[i] + ans; ..

문제 링크 : boj.kr/32027난이도 : 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;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector place(n); // LR vector L, R; for(int i = 0; i > a >> s; if(s == "R") ..

문제 링크 : boj.kr/16043난이도 : 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, m; cin >> n >> m; vector arr(m); map _m; for(auto &u : arr) { cin >> u; _m[u] = true; } ..

문제 링크 : boj.kr/7983난이도 : 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;bool comp(pii &a, pii &b) { return a.second > b.second;}int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n); for(auto &u : arr) { ..