이슈 #324에서 솔루션 추가

Programmers/가장_큰_수_찾기.cpp

@@ -0,0 +1,15 @@
+#include <string>
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+vector<int> solution(vector<int> array) {
+    priority_queue<pair<int, int>> pq;
+
+    for (int i = 0; i < array.size(); i++) {
+        pq.push({array[i], i});
+    }
+
+    return {pq.top().first, pq.top().second};
+}