Submission

Status:

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

Subtask/Task Score:

{17/17}{17/17}{17/17}{17/17}{17/17}{17/17}

Score: 100

User: AbsolutelynotNortGlGFrFr

Problemset: ขายรถยนต์

Language: cpp

Time: 0.028 second

Submitted On: 2026-01-16 20:25:00

#include <bits/stdc++.h>
#define int long long
using namespace std;

signed main() {
    ios_base::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> prices(n);
    vector<int> efficiency(n);
    for (int i = 0; i < n; i++) {
        cin >> prices[i] >> efficiency[i];
    }
    vector<int> sufMax(n + 1, INT_MIN);
    for (int i = n - 1; i >= 0; --i) {
        sufMax[i] = max(efficiency[i], sufMax[i + 1]);
    }
    int cantSell = 0;
    for (int i = 0; i < n - 1; ++i) {
        if (sufMax[i + 1] > efficiency[i]) ++cantSell;
    }
    cout << cantSell;
}