502

502_ipo.cpp

@@ -0,0 +1,46 @@
+#include "test.h"
+
+
+class Solution {
+public:
+    int findMaximizedCapital(int k, int w, vector<int>& profits, vector<int>& capital)
+    {
+        std::multimap<int, int, std::greater<int>> profits2captial;
+        for (auto i = 0u; i < profits.size(); ++i)
+            profits2captial.insert({profits[i], capital[i]});
+
+        while (k > 0)
+        {
+            int oldK = k;
+            for (auto iter = profits2captial.begin(); iter != profits2captial.end(); ++iter)
+            {
+                if (iter->second > w)
+                    continue;
+
+                w += iter->first;
+                profits2captial.erase(iter);
+                --k;
+                break;
+            }
+
+            if (oldK == k)
+                break;
+        }
+
+        return w;
+    }
+};
+
+
+int main()
+{
+    vector<tuple<int, int, vector<int>, vector<int>>> datas = 
+    {
+        {2, 0, {1, 2, 3}, {0, 1, 1}},
+        {1, 0, {1, 2, 3}, {1, 1, 2}},
+    };
+    Solution s;
+    for (auto& data : datas)
+        cout << s.findMaximizedCapital(std::get<0>(data), std::get<1>(data), std::get<2>(data), std::get<3>(data)) << endl;
+    return 0;
+}

Makefile

@@ -14,6 +14,7 @@ targets = \
 	13_roman_to_integer.exec\
 	14_longest_common_prefix.exec\
 	15_3_sum.exec\
+	502_ipo.exec\
 
 
 CC = g++

ostream_stdcontainer.h

@@ -22,6 +22,8 @@
 #include <list>
 #include <forward_list>
 
+#include <tuple>
+
 #include <iostream>
 
 using std::cout;

test.h

@@ -46,6 +46,8 @@ using std::multiset;
 using std::unordered_set;
 using std::unordered_multiset;
 
+using std::tuple;
+
 using namespace std::placeholders;
 
 #endif