1202 not solved: timeout

Author: atobaum

1000/1202/1202.cpp

@@ -0,0 +1,52 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <utility>
+
+using namespace std;
+
+
+int main(){
+	int N, K, M, V, C;
+	vector<pair<int, int> > gems;
+	vector<int> packs;
+
+	cin >> N >> K;
+	for(int i = 0; i < N; ++i){
+		cin >> M >> V;
+		gems.push_back(make_pair(V, M));
+	}
+
+
+	for(int i = 0; i < K; ++i){
+		cin >> C;
+		packs.push_back(C);
+	}
+
+	int result = 0;
+
+	sort(gems.begin(), gems.end(), greater<pair<int, int> >());
+	sort(packs.begin(), packs.end());
+
+	for(int i = 0; i < N; ++i){
+		pair<int, int> gem = gems[i];
+		
+		// lowerbound pack 찾기
+		// binary search
+		vector<int>::iterator low = packs.begin();
+		vector<int>::iterator high = packs.end();
+
+		for(vector<int>::iterator it = packs.begin(); it != packs.end(); it++){
+			if(*it >= gem.second){
+				result += gem.first;
+				packs.erase(it);
+				break;
+			}
+		}
+
+		if(packs.empty()) break;
+	}
+
+	cout << result << endl;
+	return 0;
+}

1000/1202/1202.py

@@ -0,0 +1,45 @@
+def lowerbound(li, v):
+    if v > li[-1]:
+        return None
+    if v <= li[0]:
+        return 0
+    low = 0
+    high = len(li)
+
+    while high - low < 2:
+        mid = (low + high) // 2
+        if li[mid] < v:
+            high = mid
+        else:
+            low = mid
+
+    return low 
+
+def main():
+    N, K = map(int, input().split())
+    gems = []
+    packs = []
+
+    for _ in range(N):
+        M, V = map(int, input().split())
+        gems.append((V, M))
+
+    for _ in range(K):
+        packs.append(int(input()))
+
+    gems.sort(reverse = True)
+    packs.sort()
+
+    res = 0
+
+    for V, M in gems:
+        pack_idx = lowerbound(packs, M)
+        if not pack_idx == None:
+            packs.pop(pack_idx)
+            res += V
+        if len(packs) == 0:
+            break
+
+    print(res)
+
+main()

1000/1202/1202.test.txt

@@ -0,0 +1,8 @@
+3 2
+1 65
+5 23
+2 99
+10
+2
+
+164