| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1339291 | ahmetlbktd4 | Dodatna (COCI25_dodatna) | C++20 | 197 ms | 21324 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());
if (st.size() == k)
p = max(p,*st.begin() - x.ff);
}
cout << p << "\n";
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
