lickelon.log

문제 링크 : 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/24146난이도 : G3태그 : 우선순위 큐, 정수론 Baekjoon Online JudgeBaekjoon Online Judge 프로그래밍 문제를 풀고 온라인으로 채점받을 수 있는 곳입니다.www.acmicpc.net코드#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 compare{ bool operator()(pii &a, pii &b) { return a.first*b.second > b.first..

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

문제 링크 : 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/1374난이도 : 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 sv(n), ev(n); for(int i = 0; i > input >> sv[i] >> ev[i]; } sort(all(sv)); sort(all..

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