6차시 업로드

YIM2UL2ET/README.md

@@ -7,4 +7,5 @@
 | 3차시 | 2024.02.18 |  스택  | [BOJ 2504](https://www.acmicpc.net/problem/2504)  | [BOJ 2504 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/9) |
 | 4차시 | 2024.02.21 |  덱  | [BOJ 1021](https://www.acmicpc.net/problem/1021)  | [BOJ 1021 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/12) |
 | 5차시 | 2024.02.21 |  큐  | [BOJ 1158](https://www.acmicpc.net/problem/1158)  | [BOJ 1158 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/16) |
+| 5차시 | 2024.02.21 |  정렬  | [BOJ 1599](https://www.acmicpc.net/problem/1599)  | [BOJ 1599 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/21) |
 ---

YIM2UL2ET/정렬/6차시 - BOJ 1599.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <algorithm>
+
+std::string change_string(std::string str)
+{
+    int delay = 0;
+    std::string new_str = str;
+    for (int i = 0; i < str.size(); i++) {
+        if (str[i] == 'k') new_str[i-delay] = 'c';
+        else if (str[i] > 'n') new_str[i-delay]++;
+        else if (str[i] == 'n' && i+1 < str.size() && str[i+1] == 'g') {
+            new_str.erase(new_str.begin() + (i++) - delay);
+            new_str[i - (++delay)] = 'o';
+        }
+    }
+    return new_str;
+}
+
+bool compare(std::string str1, std::string str2)
+{
+    return change_string(str1) < change_string(str2);
+}
+
+int main(void)
+{
+    int n;
+    std::cin >> n;
+
+    std::string str[n];
+    for (int i = 0; i < n; i++) std::cin >> str[i];
+
+    std::sort(str, str+n, compare);
+
+    for (int i = 0; i < n; i++) std::cout << str[i] << std::endl;
+    return 0;
+}