UVa 1149 - Bin Packing [贪心]
2015-03-13 17:23
429 查看
这题算贪心中最简单的,属于背包问题吧,写的效率有点低,用数组加指针控制应该更好。
#include <iostream> #include <deque> #include <iterator> #include <functional> #include <algorithm> using namespace std; int main() { int T; cin >> T; while(T--){ deque<int> a; int n, k; cin >> n >> k; for(int i = 0; i < n; ++i){ int t; cin >> t; a.push_back(t); } sort(a.begin(), a.end(), greater<int>()); int cnt = 0; while(!a.empty()){ ++cnt; //copy(a.begin(), a.end(), ostream_iterator<int>(cout, " ")); //cout << endl; if(a.size()>=2){ int x = a.front(); a.pop_front(); deque<int>::iterator it = lower_bound(a.begin(), a.end(), k - x, greater<int>()); if(it != a.end()) a.erase(it); } else a.pop_back(); } cout << cnt << endl; if(T) cout << endl; } return 0; }
相关文章推荐
- UVa - 1149 Bin Packing( 经典背包 贪心 )
- UVa 1149 Bin Packing 【贪心】
- uva 1149 Bin Packing(贪心)
- UVa 1149 Bin Packing (二分 + 贪心)
- UVA 1149 Bin Packing 装箱(贪心)
- Uva1149 Bin Packing【贪心】
- UVa 1149 (贪心) Bin Packing
- UVA 1149 Bin Packing 装箱(简单贪心)
- UVA 1149 Bin Packing 装箱 经典贪心 (SWERC 2005)
- UVA 1149 - Bin Packing ( 贪心 + 二分 & STL )
- 【uva】1149-Bin Packing(贪心 + STL )
- UVA 1149 Bin Packing(贪心)
- UVA-1149 Bin Packing (贪心)
- UVA 1149 bin packing (贪心)
- UVA - 1149 Bin Packing 贪心水题
- UVa 1149 - Bin Packing [贪心]
- 习题8-1 UVA - 1149 Bin Packing 装箱 (滑动窗口)
- UVA 1149 - Bin Packing
- UVA 1149 Bin Packing
- UVA 1149 Bin Packing