프로그래머스#40 #42 #43 풀이 추가

Programmers/Level2/40_MagicElevator.cpp

@@ -0,0 +1,35 @@
+#include <string>
+#include <vector>
+
+using namespace std;
+
+// 마법의 엘리베이터
+// https://school.programmers.co.kr/learn/courses/30/lessons/148653?language=cpp
+
+int solution(int storey) {
+    int count = 0;
+
+    while(storey != 0)
+    {
+        int mod = storey % 10;
+        storey /= 10;
+
+        if(mod > 5)
+        {
+            count += (10-mod);
+            storey += 1;
+        }
+        else if(mod == 5 && (storey%10) >= 5)
+        {
+            count += 5;
+            storey += 1;
+        }
+        else
+        {
+            count += mod;
+        }
+
+    }
+
+    return count;
+}

Programmers/Level2/42_DotPlotting.cpp

@@ -0,0 +1,23 @@
+#include <string>
+#include <vector>
+#include <cmath>
+
+using namespace std;
+
+// 점 찍기
+// https://school.programmers.co.kr/learn/courses/30/lessons/140107
+
+long long solution(int k, int d) {
+    long long answer = 0;
+    long long limit = (long long)d * (long long)d;
+
+    for(int a = 0; a <= d; a += k)
+    {
+        long long squared_maxB = limit - (long long)a* (long long)a;
+        long long maxB = (long long)sqrt(squared_maxB);
+
+        answer += (maxB / k) + 1;
+    }
+
+    return answer;
+}

Programmers/Level2/43_SelectTangerines.cpp

@@ -0,0 +1,31 @@
+#include <string>
+#include <vector>
+#include <unordered_map>
+#include <algorithm>
+
+using namespace std;
+
+// 귤 고르기
+// https://school.programmers.co.kr/learn/courses/30/lessons/138476
+
+int solution(int k, vector<int> tangerine) {
+    int answer = 0;
+    unordered_map<int, int> um;
+    for(int val : tangerine)
+    {
+        um[val]++;
+    }
+    vector<pair<int,int>> sorted(um.begin(), um.end());    
+    sort(sorted.begin(), sorted.end(), [](const pair<int,int> &a, const pair<int,int> &b){
+        return a.second > b.second;
+    });
+
+    for(auto& val : sorted)
+    {
+        k -= val.second;
+        answer++;
+        if(k<=0) break;
+    }
+
+    return answer;
+}