通用版2.U

最新推荐文章于 2024-09-10 19:01:49 发布

funklayer

最新推荐文章于 2024-09-10 19:01:49 发布

阅读量182

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/funklayer/article/details/79356633

版权

贪心专栏收录该内容

7 篇文章 0 订阅

订阅专栏

A set of n 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l and each item i has length li<=l . We look for a minimal number of bins q such that

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 n , l , l1 , ..., ln , to compute the optimal number of bins q .

Input

The first line of the input contains the number of items n (1<=n<=10 ⁵) . The second line contains one integer that corresponds to the bin length l<=10000 . We then have n lines containing one integer value that represents the length of the items.

Output

Your program has to write the minimal number of bins required to pack all items.

Sample Input

Sample Output

Hint

The sample instance and an optimal solution is shown in the figure below. Items are numbered from 1 to 10 according to the input order.

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int s[100010];
int main()
{
    int n,l,i,j,ans=0;
    scanf("%d%d",&n,&l);
    for(i=0;i<=n-1;i++){
        scanf("%d",&s[i]);
    }
    sort(s,s+n);
    //for(i=0;i<=n-1;i++)printf("%d,",s[i]);
    i=0;
    j=n-1;
   // printf("\n\n");
    while(i<j){
        while(s[i]+s[j]>l){
            ans++;
            j--;
        }
        //printf("%d,%d\n",s[i],s[j]);
        ans++;
        i++;
        j--;
        if(i==j)ans++;
    }
    printf("%d\n",ans);
    return 0;
}

题意大概是有n个道具，第i个道具长Li，有箱子可以装这些道具，每个箱子最多装两个道具，箱子本身有长度l，问把这些道具装完最少需要多少箱子

先给长度由小到大排个序，小的尽量和大的结合，如果大的找不到结合的就独自装一个箱子里。