提出 #66308340

---

ソースコード 拡げる

#include <bits/stdc++.h>

using LL = long long;
#define int LL // delete if MLE/TLE

using namespace std;
using vInt = vector<int>;
using vLL = vector<LL>;
using pLL = pair<LL, LL>;
using vPLL = vector<pLL>;
using pii = pair<int, int>;
using vPii = vector<pii>;
using matInt = vector<vInt>;
using matPii = vector<vPii>;
using matLL = vector<vLL>;
using vBool = vector<bool>;
using matBool = vector<vBool>;
using vStr = vector<string>;

#define all(x) (x).begin(), (x).end()
#define cyes cout << "Yes" << '\n'
#define cno cout << "No" << '\n'
#define for0(i, n) for(int (i)=0; (i)<(n); (i)++)
#define for1(i, n) for(int (i)=1; (i)<=(n); (i)++) 
#define newInt(n) int n; cin >> n
#define newLL(n) LL n; cin >> n
#define newVInt(A, f, t) vInt A(t); for(int i=f; i<t; i++) cin >> A[i]
#define newVLL(A, f, t) vLL A(t); for(int i=f; i<t; i++) cin >> A[i]
#define endl '\n'
#define ff first
#define ss second

void solve(){
    int N, M;
    cin >> N >> M;

    vPii A(M+1);
    for(int i=1; i<=M; i++)
        cin >> A[i].ff >> A[i].ss;

    vInt X(N+2);
    for(int i=1; i<=M; i++){
        X[A[i].ff]++;
        X[A[i].ss+1]--;
    }
    for(int i=1; i<=N; i++)
        X[i] += X[i-1];

    int minv = 1e18;
    for(int i=1; i<=N; i++)
        minv = min(minv, X[i]);
        
    cout << minv << '\n';
}

int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    solve();

    return 0;
}

提出情報

ジャッジ結果