UVA 1149 Bin Packing
来源:互联网 发布:中国平安证券软件 编辑:程序博客网 时间:2024/05/19 07:09
分析
至多俩,大小配。
代码
#include <cstdio>#include <algorithm>#define MAX_N 100005using std::sort;int N, L, A[MAX_N];void solve(){ sort(A, A+N); int l = 0, r = N-1, a = 0; while (l <= r) if (A[l] + A[r] <= L) { a++; l++; r--; } else { a++; r--; } printf("%d\n", a);}int main(){ int T; scanf("%d", &T); while (T--) { scanf("%d%d", &N, &L); for (int i = 0; i < N; i++) scanf("%d", &A[i]); solve(); if (T) printf("\n"); } return 0;}
题目
Description
A set of
- each bin contains at most 2 items,
- each item is packed in one of the
q bins, - the sum of the lengths of the items packed in a bin does not exceed
l .
You are requested, given the integer values
Input
The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.
The first line of the input file contains the number of items
Output
For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.
For each input file, your program has to write the minimal number of bins required to pack all items.
Sample Input
1108070153035108020351030
Sample Output
6
- Uva - 1149 - Bin Packing
- UVA 1149 - Bin Packing
- UVA 1149 Bin Packing
- uva 1149Bin Packing
- UVA 1149 Bin packing
- UVA 1149 Bin Packing
- UVA - 1149 Bin Packing
- uva 1149/Bin Packing
- UVA 1149 Bin Packing
- UVa-1149 Bin Packing
- UVa 1149 - Bin Packing [贪心]
- UVA 1149(p253)----Bin Packing
- UVA 1149-Bin Packing
- UVA 1149 Bin Packing(贪心)
- 【uva】1149-Bin Packing(贪心 + STL )
- UVa #1149 Bin Packing (习题8-1)
- UVA - 1149 Bin Packing 贪心水题
- UVA 1149 bin packing (贪心)
- 图的三种存储方式
- TCP/IP,http,socket,长连接,短连接
- MYSQL 身份证升位算法
- log_bin_trust_function_creators & max_allowed_packet
- 【VR】Leap Motion 官网文档 ConfidenceTransparency (确定性透明处理)
- UVA 1149 Bin Packing
- 接水问题
- 不改掉这些习惯别想赚钱,有的吃苦头!
- Logback介绍及入门
- HTML5 之基础 (1)
- LoadRunner函数中文翻译(全)
- linux rsync服务配置使用实例
- 常用字符串Hash函数
- hduoj 13375 Flowery Trails