zoukankan      html  css  js  c++  java
  • Taxi

    /*

    After the lessons n groups of schoolchildren went outside and decided to visit Polycarpus to celebrate his birthday. We know that the i-th group consists of si friends (1 ≤ si ≤ 4), and they want to go to Polycarpus together. They decided to get there by taxi. Each car can carry at most four passengers. What minimum number of cars will the children need if all members of each group should ride in the same taxi (but one taxi can take more than one group)?

    Input

    The first line contains integer n (1 ≤ n ≤ 105) — the number of groups of schoolchildren. The second line contains a sequence of integers s1, s2, ..., sn (1 ≤ si ≤ 4). The integers are separated by a space, si is the number of children in the i-th group.

    Output

    Print the single number — the minimum number of taxis necessary to drive all children to Polycarpus.

    Example

    Input
    5
    1 2 4 3 3
    Output
    4
    Input
    8
    2 3 4 4 2 1 3 1
    Output
    5

    Note

    In the first test we can sort the children into four cars like this:

    • the third group (consisting of four children),
    • the fourth group (consisting of three children),
    • the fifth group (consisting of three children),
    • the first and the second group (consisting of one and two children, correspondingly).

    There are other ways to sort the groups into four cars.

    */

    #include <iostream>
    
    using namespace std;
    
    
    int main() {
        int n;
        int x;
        cin>>n;
        int counter = 0;
        int num1 = 0, num2 = 0, num3 = 0;
        while(n--)
        {
            cin >> x;
            if (x == 1)
            {
                num1++;
            }
            if (x == 2)
            {
                num2++;
            }
            if (x == 3)
            {
                num3++;
            }
            if (x == 4)
            {
                counter++;
            }
        }
        if (num3 >= num1)
        {
            counter += num3;
            counter += ( (num2 + 1) / 2 );//无论 num2 为偶数还是奇数都为(num2 + 1)/ 2
        }
        if (num3 < num1)
        {
            counter += num3;
            num1 = num1 - num3;
            counter += (num2 / 2);
            num2 = num2 % 2;
            if (num2 == 1)
            {
                counter += (num1 + 1) / 4 + 1;
            }
            if (num2 == 0)
            {
                if (num1 > 0)
                {
                    counter += (num1 - 1) / 4 + 1;
                }
                if (num1 == 0)
                {
                    counter = counter + 0;
                }
            }
        }
        cout << counter << endl;
        return 0;
    }

     

  • 相关阅读:
    ScrollView阻尼效果
    leetcode ----Trie/stack专题
    【LeetCode-面试算法经典-Java实现】【066-Plus One(加一)】
    老板问:多长时间搞定?开发说3天,測试说2天,然后……
    RxJava系列之中的一个 初识Rxjava
    【机器学习具体解释】SVM解二分类,多分类,及后验概率输出
    win8 metro 自己写摄像头录像项目
    战五渣系列之八(绝杀AOP)
    UEFI与MBR区别
    Centos|Rhel搭建vsftp
  • 原文地址:https://www.cnblogs.com/jxust-jiege666/p/6433086.html
Copyright © 2011-2022 走看看