ural 1273. Tie

  1 /**
  2 Create By yzx - stupidboy
  3 */
  4 #include <cstdio>
  5 #include <cstring>
  6 #include <cstdlib>
  7 #include <cmath>
  8 #include <deque>
  9 #include <vector>
 10 #include <queue>
 11 #include <iostream>
 12 #include <algorithm>
 13 #include <map>
 14 #include <set>
 15 #include <ctime>
 16 #include <iomanip>
 17 using namespace std;
 18 typedef long long LL;
 19 typedef double DB;
 20 #define For(i, s, t) for(int i = (s); i <= (t); i++)
 21 #define Ford(i, s, t) for(int i = (s); i >= (t); i--)
 22 #define Rep(i, t) for(int i = (0); i < (t); i++)
 23 #define Repn(i, t) for(int i = ((t)-1); i >= (0); i--)
 24 #define rep(i, x, t) for(int i = (x); i < (t); i++)
 25 #define MIT (2147483647)
 26 #define INF (1000000001)
 27 #define MLL (1000000000000000001LL)
 28 #define sz(x) ((int) (x).size())
 29 #define clr(x, y) memset(x, y, sizeof(x))
 30 #define puf push_front
 31 #define pub push_back
 32 #define pof pop_front
 33 #define pob pop_back
 34 #define ft first
 35 #define sd second
 36 #define mk make_pair
 37 inline void SetIO(string Name)
 38 {
 39     string Input = Name+".in",
 40     Output = Name+".out";
 41     freopen(Input.c_str(), "r", stdin),
 42     freopen(Output.c_str(), "w", stdout);
 43 }
 44 
 45 
 46 inline int Getint()
 47 {
 48     int Ret = 0;
 49     char Ch = ‘ ‘;
 50     bool Flag = 0;
 51     while(!(Ch >= ‘0‘ && Ch <= ‘9‘))
 52     {
 53         if(Ch == ‘-‘) Flag ^= 1;
 54         Ch = getchar();
 55     }
 56     while(Ch >= ‘0‘ && Ch <= ‘9‘)
 57     {
 58         Ret = Ret * 10 + Ch - ‘0‘;
 59         Ch = getchar();
 60     }
 61     return Flag ? -Ret : Ret;
 62 }
 63 
 64 const int N = 110;
 65 typedef pair<int, int> II;
 66 int n;
 67 II Data[N];
 68 int Arr[N], Dp[N];
 69 
 70 inline void Input()
 71 {
 72     scanf("%d", &n);
 73     For(i, 1, n) scanf("%d%d", &Data[i].ft, &Data[i].sd);
 74 }
 75 
 76 inline void Solve()
 77 {
 78     sort(Data + 1, Data + 1 + n);
 79     For(i, 1, n) Arr[i] = Data[i].sd;
 80     For(i, 1, n)
 81     {
 82         Dp[i] = 1;
 83         For(j, 1, i - 1)
 84             if(Arr[j] < Arr[i])
 85                 Dp[i] = max(Dp[i], Dp[j] + 1);
 86     }
 87 
 88     int Ans = 0;
 89     For(i, 1, n) Ans = max(Ans, Dp[i]);
 90     printf("%d\n", n - Ans);
 91 }
 92 
 93 int main()
 94 {
 95     #ifndef ONLINE_JUDGE
 96     SetIO("I");
 97     #endif
 98     Input();
 99     Solve();
100     return 0;
101 }