Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.007 s | 1 KBi |
#2 |
Correcto
|
0.018 s | 2 KBi |
#3 |
Correcto
|
0.007 s | 2 KBi |
#4 |
Correcto
|
0.004 s | 0 KBi |
#5 |
Correcto
|
0.004 s | 0 KBi |
#6 |
Correcto
|
0.007 s | 2 KBi |
#7 |
Correcto
|
0.024 s | 2 KBi |
#8 |
Correcto
|
0.006 s | 2 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 1 KBi |
#11 |
Correcto
|
0.003 s | 0 KBi |
#12 |
Correcto
|
0.011 s | 2 KBi |
#13 |
Correcto
|
0.383 s | 2 KBi |
#14 |
Correcto
|
0.274 s | 3 KBi |
#15 |
Correcto
|
0.873 s | 4 KBi |
/// Write by Daniel Perez .PERAPRO #include<bits/stdc++.h> using namespace std; #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define pb push_back #define ff first #define ss second typedef long long ll; typedef unsigned long long ull; typedef long double ld; using vi=vector<int>; using vl=vector<ll>; using pii=pair<int,int>; char el = '\n'; char esp = ' '; template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } ostream& operator<<(ostream& os, const vector<int> &v){ for(auto const &i: v){ os<<i<<" "; } os<<'\n'; return os; } string yes="Yes"; string no="No"; int main(){ fast_io; /* freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); */ int clases; cin>>clases; priority_queue<pii, vector<pii>, greater<pii>> q; for(int i=0;i<clases;i++){// 0 close? string open, close; cin>>open>>close; q.push({stoi(open.substr(0,2) + open.substr(3,2)),1}); q.push({stoi(close.substr(0,2) + close.substr(3,2)),0}); } int ans=0; int cur=0; while(q.size()){ int tm=q.top().ff; int type=q.top().ss; q.pop(); if(type) cur++; else cur--; ckmax(ans,cur); } cout<<ans<<el; } /* */