codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

158B.md (1564B)


      1 Source: https://codeforces.com/problemset/problem/158/B
      2 
      3 B. Taxi
      4 
      5 time limit per test
      6 
      7 3 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 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 *s**i* friends (1 ≤ *s**i* ≤ 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)?
     22 
     23 Input
     24 
     25 The first line contains integer *n* (1 ≤ *n* ≤ 105) — the number of groups of schoolchildren. The second line contains a sequence of integers *s*1, *s*2, ..., *s**n* (1 ≤ *s**i* ≤ 4). The integers are separated by a space, *s**i* is the number of children in the *i*-th group.
     26 
     27 Output
     28 
     29 Print the single number — the minimum number of taxis necessary to drive all children to Polycarpus.
     30 
     31 Examples
     32 
     33 Input
     34 
     35 ```
     36 5  
     37 1 2 4 3 3
     38 ```
     39 
     40 Output
     41 
     42 ```
     43 4
     44 ```
     45 
     46 Input
     47 
     48 ```
     49 8  
     50 2 3 4 4 2 1 3 1
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 5
     57 ```
     58 
     59 Note
     60 
     61 In the first test we can sort the children into four cars like this:
     62 
     63 * the third group (consisting of four children),
     64 * the fourth group (consisting of three children),
     65 * the fifth group (consisting of three children),
     66 * the first and the second group (consisting of one and two children, correspondingly).
     67 
     68 There are other ways to sort the groups into four cars.