CF269B.Greenhouse Effect

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Emuskald is an avid horticulturist and owns the world's longest greenhouse — it is effectively infinite in length.

Over the years Emuskald has cultivated nn plants in his greenhouse, of mm different plant species numbered from 1 to mm . His greenhouse is very narrow and can be viewed as an infinite line, with each plant occupying a single point on that line.

Emuskald has discovered that each species thrives at a different temperature, so he wants to arrange m1m-1 borders that would divide the greenhouse into mm sections numbered from 1 to mm from left to right with each section housing a single species. He is free to place the borders, but in the end all of the ii -th species plants must reside in ii -th section from the left.

Of course, it is not always possible to place the borders in such way, so Emuskald needs to replant some of his plants. He can remove each plant from its position and place it anywhere in the greenhouse (at any real coordinate) with no plant already in it. Since replanting is a lot of stress for the plants, help Emuskald find the minimum number of plants he has to replant to be able to place the borders.

输入格式

The first line of input contains two space-separated integers nn and mm ( 1<=n,m<=50001<=n,m<=5000 , n>=mn>=m ), the number of plants and the number of different species. Each of the following nn lines contain two space-separated numbers: one integer number sis_{i} ( 1<=si<=m1<=s_{i}<=m ), and one real number xix_{i} ( 0<=xi<=1090<=x_{i}<=10^{9} ), the species and position of the ii -th plant. Each xix_{i} will contain no more than 6 digits after the decimal point.

It is guaranteed that all xix_{i} are different; there is at least one plant of each species; the plants are given in order "from left to the right", that is in the ascending order of their xix_{i} coordinates (x_{i}<x_{i+1},1<=i<n) .

输出格式

Output a single integer — the minimum number of plants to be replanted.

输入输出样例

  • 输入#1

    3 2
    2 1
    1 2.0
    1 3.100
    

    输出#1

    1
    
  • 输入#2

    3 3
    1 5.0
    2 5.5
    3 6.0
    

    输出#2

    0
    
  • 输入#3

    6 3
    1 14.284235
    2 17.921382
    1 20.328172
    3 20.842331
    1 25.790145
    1 27.204125
    

    输出#3

    2
    

说明/提示

In the first test case, Emuskald can replant the first plant to the right of the last plant, so the answer is 1.

In the second test case, the species are already in the correct order, so no replanting is needed.

首页