가장 큰 수

kuyhochung/2. 삼성 기출/13458_시험감독.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+using namespace std;
+#define MAX_ENTRY 1000003
+
+long long classes[MAX_ENTRY];
+int N, B, C;
+
+int main() {
+
+cin >> N;
+for (int i = 0; i < N; i++) {
+cin >> classes[i];
+}
+cin >> B >> C;
+
+long long result = 0;
+
+for (int i = 0; i < N; i++) {
+classes[i] -= B;
+result++;
+
+if (classes[i] > 0) {
+result += classes[i] / C;
+if (classes[i] % C > 0)
+result++;
+}
+}
+
+cout << result;
+
+return 0;
+}

kuyhochung/5. 프로그래머스/가장 큰 수.cpp

@@ -0,0 +1,39 @@
+#include <string>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+string solution(vector<int> numbers) {
+ string answer = "";
+
+ vector <pair <int, int> > compare;
+
+ for (int i = 0; i < numbers.size(); i++) {
+ int original = numbers[i];
+ while (numbers[i] < 1000 && numbers[i] != 0) {
+ if (numbers[i] < 10) {
+ numbers[i] = numbers[i] * 10 + numbers[i];
+ }
+ else if (numbers[i] < 100) {
+ numbers[i] = numbers[i] * 100 + numbers[i];
+ }
+ else {
+ numbers[i] = numbers[i]*10 + numbers[i]/100;
+ }
+ }
+ compare.push_back(make_pair(numbers[i], original));
+ }
+ sort(compare.begin(),compare.end());
+
+ while(!compare.empty()) {
+ if (answer == "0" && compare.back().second == 0) {
+ compare.pop_back();
+ continue;
+ }
+ answer += to_string(compare.back().second);
+ compare.pop_back();
+ }
+
+ return answer;
+}