From 5a62fe997504b819ecb885e0c265d20221aa1742 Mon Sep 17 00:00:00 2001
From: GitHub Action <action@github.com>
Date: Fri, 29 Nov 2024 12:45:24 +0000
Subject: [PATCH] =?UTF-8?q?=EC=9D=B4=EC=8A=88=20#403=EC=97=90=EC=84=9C=20?=
 =?UTF-8?q?=EC=86=94=EB=A3=A8=EC=85=98=20=EC=B6=94=EA=B0=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0\353\212\245\352\260\234\353\260\234.cpp" | 35 +++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 "Programmers/\352\270\260\353\212\245\352\260\234\353\260\234.cpp"

diff --git "a/Programmers/\352\270\260\353\212\245\352\260\234\353\260\234.cpp" "b/Programmers/\352\270\260\353\212\245\352\260\234\353\260\234.cpp"
new file mode 100644
index 0000000..2197142
--- /dev/null
+++ "b/Programmers/\352\270\260\353\212\245\352\260\234\353\260\234.cpp"
@@ -0,0 +1,35 @@
+// progresse와 speed를 넘기면 작업 시간을 반환해주는 함수
+// 반복으로 작업시간을 가지고 
+
+#include <string>
+#include <vector>
+#include <queue>
+#include <iostream>
+
+using namespace std;
+
+vector<int> solution(vector<int> progresses, vector<int> speeds) {
+    vector<int> result;
+    queue<int> daysQueue;
+    
+    for (size_t i = 0; i < progresses.size(); ++i) {
+        int remainingProgress = 100 - progresses[i];
+        int days = (remainingProgress + speeds[i] - 1) / speeds[i];
+        daysQueue.push(days);
+    }
+    
+    while (!daysQueue.empty()) {
+        int currentDay = daysQueue.front();
+        daysQueue.pop();
+        int count = 1;
+        
+        while (!daysQueue.empty() && daysQueue.front() <= currentDay) {
+            daysQueue.pop();
+            count++;
+        }
+        
+        result.push_back(count);
+    }
+    
+    return result;
+}
\ No newline at end of file