lickelon.log

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

문제 링크 : boj.kr/24524난이도 : 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); string s, t; cin >> s >> t; map idx; for(int i = 0; i cnt(t.size()+1, 0); cnt[0] = INF; for(int i = 0; i 풀이..

문제 링크 : boj.kr/31719난이도 : 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 T; cin >> T; while(T--) { int n; cin >> n; vector arr(n); for(auto &u : arr) c..

문제 링크 : boj.kr/17828난이도 : 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, x;; cin >> n >> x; if(x 26 * n) { cout arr(n); x -= n; for(int i = n-1; i >= 0; i--) { ..

문제 링크 : boj.kr/15553난이도 : 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; int before, input; cin >> before; vector gap(n-1); for(int i = 0; i > input; ..

문제 링크 : boj.kr/6068난이도 : 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) { ..

문제 링크 : boj.kr/1263난이도 : 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) {..

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

문제 링크 : boj.kr/1052난이도 : 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; bitset bt; int ans = 0; while(true) { bt = bitset(n); if(bt.count(..

문제 링크 : boj.kr/2513난이도 : 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, s; cin >> n >> k >> s; vector arr1, arr2; for(int i = 0; i > a >> b; if(a ()); sort(all(arr..