A844.Counting Liars--Bronze

普及-

USACO

通过率:0%

时间限制:1.00s

内存限制:128MB

题目描述

Bessie the cow is hiding somewhere along the number line. Each of Farmer
John's NN other cows (1N10001\le N\le 1000) have a piece of information to share:
the ii-th cow either says that Bessie is hiding at some location less than or
equal to pip_i, or that Bessie is hiding at some location greater than or
equal to pip_i (0pi1090\le p_i\le 10^9).
Unfortunately, it is possible that no hiding location is consistent with the
answers of all of the cows, meaning that not all of the cows are telling the
truth. Count the minimum number of cows that must be lying.

输入格式

The first line contains NN.
The next NN lines each contain either L or G, followed by an integer pip_i. L
means that the ii-th cow says that Bessie's hiding location is less than or
equal to pip_i, and G means that ii-th cow says that Bessie's hiding location
is greater than or equal to pip_i.

输出格式

The minimum number of cows that must be lying.

输入输出样例

  • 输入#1

    2
    G 3
    L 5
    

    输出#1

    0
    

说明/提示

It is possible that no cow is lying.

首页