Submission

Score: 0

User: angpangSK

Problemset: ห้องสมุดเมือง 3M

Language: c

Time: 0.001 second

Submitted On: 2025-09-25 19:41:00

#include <stdio.h>

int floorfunction(int n) {
    if (n % 2 == 0) {
        return n / 2;
    }
    else
        return (n / 2) + 1;
}

int main() {
    int n;
    scanf("%d", &n);
    int a[n][2];
    int max = 0;
    int min = 200000000;
    for (int i = 0; i < n; i++) {
        scanf("%d %d", &a[i][0], &a[i][1]);
        if (a[i][1]-1 > max) {
            max = a[i][1]-1;
        }
        if (a[i][0] < min) {
            min = a[i][0];
        }
    }
    int answer = floorfunction(max - min) + min - 1;
    printf("%d",answer);
}