Submission #1339289

#TimeUsernameProblemLanguageResultExecution timeMemory
1339289ahmetlbktd4Dodatna (COCI25_dodatna)C++20
13 / 70
113 ms13132 KiB
#include "bits/stdc++.h"
#define ff first
#define ss second
using namespace std;

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,k;
    cin >> n >> k;
    int l[n],r[n];
    vector <pair<int,int>> a;
    for (int i = 0;i < n;i++){
        cin >> l[i] >> r[i];
        a.push_back({l[i],i});
        a.push_back({r[i],-i});
    }
    sort(a.begin(),a.end());
    multiset<int>st;
    int p = 0;
    for (auto &x : a){
        if (x.ss >= 0){
            st.insert(r[x.ss]);
            if (st.size() > k)
            st.erase(st.begin());
        }
        else if (*st.begin() == x.ff)
        st.erase(st.begin());
        p = max(p,*st.begin() - x.ff);
    }
    cout << p << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...