codeforces-scrape

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

545D.md (1322B)


      1 Source: https://codeforces.com/problemset/problem/545/D
      2 
      3 D. Queue
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Little girl Susie went shopping with her mom and she wondered how to improve service quality.
     22 
     23 There are *n* people in the queue. For each person we know time *t**i* needed to serve him. A person will be disappointed if the time he waits is more than the time needed to serve him. The time a person waits is the total time when all the people who stand in the queue in front of him are served. Susie thought that if we swap some people in the queue, then we can decrease the number of people who are disappointed.
     24 
     25 Help Susie find out what is the maximum number of not disappointed people can be achieved by swapping people in the queue.
     26 
     27 Input
     28 
     29 The first line contains integer *n* (1 ≤ *n* ≤ 105).
     30 
     31 The next line contains *n* integers *t**i* (1 ≤ *t**i* ≤ 109), separated by spaces.
     32 
     33 Output
     34 
     35 Print a single number — the maximum number of not disappointed people in the queue.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 5  
     43 15 2 1 5 3
     44 ```
     45 
     46 Output
     47 
     48 ```
     49 4
     50 ```
     51 
     52 Note
     53 
     54 Value 4 is achieved at such an arrangement, for example: 1, 2, 3, 5, 15. Thus, you can make everything feel not disappointed except for the person with time 5.