Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Strictly in the Middle

Strictly in the Middle

Difficulty: 900 3000 ms 128 MB

implementation

Count the elements that are strictly greater than the minimum AND strictly smaller than the maximum.

Input: the first line has N; the second line has N integers.

Output: the count of strictly-interior values.

Constraints:

  • 1 ≤ N ≤ 105
  • |ai| ≤ 109

Sample Tests

Input 1
5
1 2 2 3 3
Output 1
2
Input 2
3
7 7 7
Output 2
0

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen