lickelon.log

문제 링크 : http://boj.kr/1622난이도 : S4태그 : 문자열, 정렬코드#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; while(getline(cin, s) && getline(cin, t)) { for(int i = 0; i 풀이counting sort를 통해 해결할 수 있다...

문제 링크 : boj.kr/15975난이도 : 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 main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n); for(auto &e : arr) cin >> e.first >> e.second; arr.push_back({0, -1}); arr.pu..

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

문제 링크 : boj.kr/1059난이도 : S4태그 : 정렬, 브루트포스코드#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 l; cin >> l; vector arr(l); for(auto &e : arr) cin >> e; arr.push_back(0); arr.push_back(1001); ..

문제 링크 : boj.kr/7795난이도 : 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 main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int T; cin >> T; while(T--) { int n, m; cin >> n >> m; vector arr(n); for(auto &e : a..

문제 링크 : boj.kr/10825난이도 : S4태그 : 정렬코드#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;using info = tuple;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n); for(auto &[s, a, b, c] : arr) { cin >> s >> a >> b >> c; ..

문제 링크 : boj.kr/31246난이도 : S5태그 : 정렬코드#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(int i = 0; i > a >> b; arr[i] = b-a; } sort(all(arr)); ..

문제 링크 : boj.kr/32752난이도 : S5태그 : 정렬코드#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, r; cin >> n >> l >> r; vector arr(n); for(auto &e : arr) cin >> e; sort(arr.begin()+l-1, arr.begin()+r..

문제 링크 : boj.kr/26168난이도 : S4태그 : 정렬, 이분탐색코드#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); for(auto &e : arr) cin >> e; sort(all(arr)); while(m--) { ..

문제 링크 : boj.kr/31797난이도 : S4태그 : 정렬코드#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*2); for(int i = 0; i > arr[i*2].first >> arr[i*2+1].first; arr[i*2].se..