- Category:
- Document
- Tags:
-
- File Size:
- 1kb
- Update:
- 2018-04-27
- Downloads:
- 0 Times
- Uploaded by:
- zilewwy
Description: Input file contains multiple test cases.
In a test case,the first line contains a single positive number N indicating the number of soldiers.(0<=N<=3000)
Next N lines :There is only one nonnegative integer on each line , indicating the level number for each soldier.( less than 30 digits);
Output
For each case, output the minimum number of broomsticks on a single line.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 贪心1009.cpp | 445 | 2018-04-26
|
| 题目.txt | 2476 | 2018-04-26 |
Download