被打败的一定无法是冠军

水题记录+1

#include <vector>
#include <map>
#include <cstring>
#include <algorithm>
#include <stack>
#include <set>
#include <cmath>
#include <queue>
#include <unordered_map>
#include <bitset>
#include <sstream>
#include <limits.h>
#include <iomanip>
using namespace std;
typedef __int128 lint;
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef pair<int, string> PIs;
typedef std::pair<int, int> IntPair;
#define Pi acos(-1)

/*
Constant suspicion, constant uncertainty, is the most esential preparation for surviving a gamble!!!
============================================================================================================
*/
const int N = 1e5+10;
const int INF = 0x3f;

int n,m,mo,ans,k;

int a[N];

void solve() {
    cin >> n >>m;

    int l,r;

    for(int i=1;i<=m;i++){
        cin >> l >> r;
        a[r]=1;
    }

    for(int i=1;i<=n;i++){
        if(!a[i]){
            ans++;
        }
    }

    cout << ans;

}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);


    ll t = 1;
    // cin >>t;
    mo = 0;
    while (mo++ != t) {
        solve();
    }
    return 0;
}