lickelon.log

문제 링크 : http://boj.kr/13019난이도 : 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 a, b; cin >> a >> b; int n = a.length(); reverse(all(a)); reverse(all(b)); int cnt = 0, id..

문제 링크 : boj.kr/27923난이도 : 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, k, l; cin >> n >> k >> l; vector h(n); for(auto &u : h) cin >> u; vector c(n); for(int i = 0..

문제 링크 : boj.kr/10975난이도 : G5태그 : 그리디, 정렬, 맵코드#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..

문제 링크 : boj.kr/31235난이도 : 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; vector arr(n); for(auto &u : arr) cin >> u; int cnt = 0; int ans = 0; int before = arr[0..

문제 링크 : boj.kr/12931난이도 : 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; cin >> n; vector arr(n); for(auto &u : arr) cin >> u; int ans = 0; int L = 0; for(auto u : arr) { ..

문제 링크 : boj.kr/27447난이도 : 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 cs(n); for(int i = 0; i > cs[i]; } sort(all(cs), greater()); int l = cs[0..

문제 링크 : boj.kr/25391난이도 : 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(pll &a, pll &b) { if(a.second == b.second) { return a.first b.second;}int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n, m, k; cin >> n >> m..

문제 링크 : boj.kr/2138난이도 : 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 check(string temp, string target) { int n = temp.size(); int cnt = 0; for(int i = 1; i > n; string curr, target; cin >> curr >> target; int ans = check(curr, target); cur..

문제 링크 : boj.kr/24023난이도 : 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, k; cin >> n >> k; vector arr(n); for(auto &u : arr) cin >> u; int s, curr; s = curr = 0; for(int i..

문제 링크 : boj.kr/20666난이도 : 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); ll n, m; cin >> n >> m; vector arr(n+1); vector visit(n+1, false); for(ll i = 1; i > arr[i]; int p; ..