codeforces-scrape

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

1213B.md (1570B)


      1 Source: https://codeforces.com/problemset/problem/1213/B
      2 
      3 B. Bad Prices
      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 Polycarp analyzes the prices of the new berPhone. At his disposal are the prices for $n$ last days: $a_1, a_2, \dots, a_n$, where $a_i$ is the price of berPhone on the day $i$.
     22 
     23 Polycarp considers the price on the day $i$ to be bad if later (that is, a day with a greater number) berPhone was sold at a lower price. For example, if $n=6$ and $a=[3, 9, 4, 6, 7, 5]$, then the number of days with a bad price is $3$ — these are days $2$ ($a_2=9$), $4$ ($a_4=6$) and $5$ ($a_5=7$).
     24 
     25 Print the number of days with a bad price.
     26 
     27 You have to answer $t$ independent data sets.
     28 
     29 Input
     30 
     31 The first line contains an integer $t$ ($1 \le t \le 10000$) — the number of sets of input data in the test. Input data sets must be processed independently, one after another.
     32 
     33 Each input data set consists of two lines. The first line contains an integer $n$ ($1 \le n \le 150000$) — the number of days. The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^6$), where $a_i$ is the price on the $i$-th day.
     34 
     35 It is guaranteed that the sum of $n$ over all data sets in the test does not exceed $150000$.
     36 
     37 Output
     38 
     39 Print $t$ integers, the $j$-th of which should be equal to the number of days with a bad price in the $j$-th input data set.
     40 
     41 Example
     42 
     43 Input
     44 
     45 ```
     46 5
     47 6
     48 3 9 4 6 7 5
     49 1
     50 1000000
     51 2
     52 2 1
     53 10
     54 31 41 59 26 53 58 97 93 23 84
     55 7
     56 3 2 1 2 3 4 5
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 3
     63 0
     64 1
     65 8
     66 2
     67 ```