Submission

Status:

[P][P][P][P][P][PPPPPPPP]

Score: 100

User: Winzzwz

Problemset: ขายรถยนต์

Language: cpp

Time: 0.026 second

Submitted On: 2025-03-05 16:51:36

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int n,nn,oa,ob,a,b,cnt,t[200200],dp[200200];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> nn >> t[i];
    }
    dp[n] = t[n];
    //cout << n << " : " << dp[n] << "\n";
    for (int i = n-1; i >= 1; i--) {
        dp[i] = max(t[i],dp[i+1]);
        //cout << i << " : " << dp[i] << "\n";
    }
    for (int i = 1; i <= n; i++) {
        if (dp[i] != t[i]) cnt++;
    }
    cout << cnt;
    
    return 0;
}