[ADD] BOJ 15577 Prosjek

- 자료구조

Author: tdm1223

acmicpc.net/README.md

@@ -743,6 +743,7 @@
 |  49  |      [평행선](https://www.acmicpc.net/problem/2358)       | [cpp](source/2358.cpp)  |  50  |        [괄호 끼워넣기](https://www.acmicpc.net/problem/11899)         | [cpp](source/11899.cpp) |
 |  51  | [천재 수학자 성필](https://www.acmicpc.net/problem/15815) | [cpp](source/15815.cpp) |  52  |          [파일 정리](https://www.acmicpc.net/problem/20291)           | [cpp](source/20291.cpp) |
 |  53  |  [Olympiad Pizza](https://www.acmicpc.net/problem/15235)  | [cpp](source/15235.cpp) |  54  |            [암기왕](https://www.acmicpc.net/problem/2776)             | [cpp](source/2776.cpp)  |
+|  55  |     [Prosjek](https://www.acmicpc.net/problem/15577)      | [cpp](source/15577.cpp) |      |                                                                       |                         |
 
 </details>
 

acmicpc.net/source/15577.cpp

@@ -0,0 +1,39 @@
+// 15577. Prosjek
+// 2022.03.14
+// 자료구조
+#include<iostream>
+#include<queue>
+
+using namespace std;
+
+int main()
+{
+    priority_queue<float, vector<float>, greater<float>> pq;
+    int n;
+    cin >> n;
+    for (int i = 0; i < n; i++)
+    {
+        float k;
+        cin >> k;
+        pq.push(k);
+    }
+
+    while (!pq.empty())
+    {
+        if (pq.size() == 1)
+        {
+            break;
+        }
+        float a = pq.top();
+        pq.pop();
+        float b = pq.top();
+        pq.pop();
+
+        pq.push((a + b) / 2.0f);
+    }
+
+    cout << fixed;
+    cout.precision(6);
+    cout << (float)pq.top() << endl;
+    return 0;
+}