Lv3_야근지수

Author: wh2per

Programmers/Lv3/Lv3_야근지수.cpp

@@ -0,0 +1,33 @@
+#include <string>
+#include <vector>
+#include <algorithm>
+#include <queue>
+using namespace std;
+
+struct work_cmp {				// top에 가장 높은 수가 가도록 정렬
+	bool operator()(int t, int u) {
+		return t < u;
+	}
+};
+
+long long solution107(int n, vector<int> works) {
+	long long answer = 0;
+	priority_queue <int, vector<int>, work_cmp > pq;
+	for (auto i : works)
+		pq.push(i);
+
+	for (int i = 0; i < n; i++) {
+		int a = pq.top();
+		pq.pop();
+		if (a == 0)
+			pq.push(0);
+		else
+			pq.push(a - 1);
+	}
+
+	while (!pq.empty()) {
+		answer += pq.top()*pq.top();
+		pq.pop();
+	}
+	return answer;
+}

Programmers/Programmers.vcxproj

@@ -112,6 +112,7 @@
     <ClCompile Include="Lv3\Lv3_섬연결하기.cpp" />
     <ClCompile Include="Lv3\Lv3_순위.cpp" />
     <ClCompile Include="Lv3\Lv3_숫자게임.cpp" />
+    <ClCompile Include="Lv3\Lv3_야근지수.cpp" />
     <ClCompile Include="Lv3\Lv3_여행경로.cpp" />
     <ClCompile Include="Lv3\Lv3_예산.cpp" />
     <ClCompile Include="Lv3\Lv3_이중우선순위큐.cpp" />
@@ -120,6 +121,7 @@
     <ClCompile Include="Lv3\Lv3_정수삼각형.cpp" />
     <ClCompile Include="Lv3\Lv3_줄서는방법.cpp" />
     <ClCompile Include="Lv3\Lv3_짝지어제거하기.cpp" />
+    <ClCompile Include="Lv3\Lv3_최고의집합.cpp" />
     <ClCompile Include="Lv3\Lv3_카카오프렌즈컬러링북.cpp" />
     <ClCompile Include="Lv3\Lv3_캠핑.cpp" />
     <ClCompile Include="Lv3\Lv3_타일장식물.cpp" />

Programmers/Programmers.vcxproj.filters

@@ -342,5 +342,11 @@
     <ClCompile Include="Lv3\Lv3_멀리뛰기.cpp">
       <Filter>소스 파일</Filter>
     </ClCompile>
+    <ClCompile Include="Lv3\Lv3_야근지수.cpp">
+      <Filter>소스 파일</Filter>
+    </ClCompile>
+    <ClCompile Include="Lv3\Lv3_최고의집합.cpp">
+      <Filter>소스 파일</Filter>
+    </ClCompile>
   </ItemGroup>
 </Project>