Submission #67512038

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll dim = 3*1e2+7;
//const ll mod = 1e9 + 7;
const ll inf = 1e18 + 77;
#define endl "\n"
#define fi first
#define pb push_back
#define se second
#define vll vector<ll>

ll n;
int main(){
    ll  l, r, x, y;
    cin>>n;
    ll cnt=0;
    cin>>l>>r;
    for(int i=1; i<=n; i++){
        cin>>x>>y;
        if(x<=l && r<=y)cnt++;
    }
    cout<<cnt<<endl;


    return 0;
}

Submission Info

Judge Result