1. problem : https://www.acmicpc.net/problem/11650 2. solution 1 :#include using namespace std;int n;const int MXN = 100'002;vector> v(MXN+2);vector> temp(MXN + 2);void merge(int st, int en) { int mid = (st + en) / 2; int lidx = st; int ridx = mid; for (int i = st; i = en) return; int mid = (st + en) / 2; merge_sort(st, mid); merge_sort(mid, en); merge(st, en);}int main(void) { ios::sync_with..

1. problem : https://www.acmicpc.net/problem/10814 2. solution 1 :#include using namespace std;int n;int ages[100002];string names[100002]; int temp1[100002];string temp2[100002];void merge(int st, int en) { int mid = (st + en) / 2; int lidx = st; int ridx = mid; for (int i = st; i = en) return; int mid = (st + en) / 2; merge_sort(st, mid); merge_sort(mid, en); merge(st, en);}int main(void)..

1. problem : https://www.acmicpc.net/problem/15688 2. solution 1 :#include using namespace std;const int MXN = 2'000'000, HALF_MAX = MXN / 2; vector isnum(MXN + 2);int main(void) { ios::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n; while (n--) { cin >> k; isnum[k + HALF_MAX]++; } for (int i = 0; i

1. problem : https://www.acmicpc.net/problem/11931 2. solution 1 :// Authored by : heheHwang// Co-authored by : BaaaaaaaaaaarkingDog// http://boj.kr/7a7deeedae3b4177a1ed53482685bf15#include using namespace std;const int MXN = 2'000'000, HALF = MXN / 2;int main(void) { ios::sync_with_stdio(0); cin.tie(0); vector isnum(MXN + 2); int N, t; cin >> N; while (N--) { cin >> t; isnum[t + HAL..

1. problem : https://www.acmicpc.net/problem/2750 2. solution 1 :#include using namespace std;int n;int arr[1005];void quick_sort(int st, int en) { if (en = arr[lidx]) lidx++; while (lidx ridx) break; swap(arr[lidx], arr[ridx]); } swap(arr[ridx], arr[st]); quick_sort(st, ridx); quick_sort(ridx + 1, en); }int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i > ar..

1. problem : https://www.acmicpc.net/problem/2751 2. solution 1 :#include using namespace std;int n;int arr[1000005];int tmp[2000005];void merge(int st, int ed) { int mid = (st + ed) / 2; int lidx = st; int ridx = mid; for (int i = st; i > n; for (int i = 0; i > arr[i]; merge_sort(0, n); for (int i = 0; i