Submission

[xSSSS][SSSSS][SSSSSSSSSS]

Score: 0

User: Pera

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

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-18 09:14:22

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    
    int n;
    cin >> n;

    vector<pair<int, int>> v(n);

    int maxchar{0};

    for (int i = 0; i < n; i++) {
        int in1, in2;

        cin >> in1 >> in2;
        v[i].first = in1;
        // Num will range from in1 to in2 - 1
        v[i].second = in2 - 1;
        if (in2 > maxchar) maxchar = in2;
    }

    vector<int> count;
    int total{0};

    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= v[i].second; ++j) {
            count[i]++;
            total++;
        }
    }

    int median = total / n;

    int current_count{0};

    for (int i = 0; i <= 20000000; i++) { // Scan through all possible book lengths
        current_count += count[i]; // Add books at this length
        
        if (current_count > median) { // If we reach the median position
            cout << i << '\n'; // i is the median value
            break;
        }
    }

}