15007：社交距离II

#include<iostream>
#include<algorithm>

#define x first
#define y second

using namespace std;

typedef pair<int, int> PII;

const int N = 1010, INF = 1e9;

PII q[N];

int main(){
    
    int n;
    scanf("%d", &n);
    
    int a, b;
    for(int i = 1; i <= n; i++){
        scanf("%d%d", &a, &b);
        q[i] = {a, b};
    }
    
    sort(q + 1, q + n + 1);
    
    // 求 min(r)
    int r = INF;
    q[0] = {-INF, 0};
    for(int i = 1; i <= n; i++)
        if(q[i].y ^ q[i - 1].y) r = min(r, q[i].x - q[i - 1].x);
    
    int res = 0;
    for(int i = 1; i <= n; i++)
        if(q[i].x - q[i - 1].x >= r && q[i].y) res++;
    
    printf("%d\n", res);
    
    return 0;
}