Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.001 s | 0 KBi |
#2 |
Correcto
|
0.001 s | 0 KBi |
#3 |
Correcto
|
0.005 s | 61 KBi |
#4 |
Correcto
|
0.006 s | 36 KBi |
#5 |
Correcto
|
0.001 s | 0 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 10 KBi |
#8 |
Correcto
|
0.001 s | 0 KBi |
#9 |
Correcto
|
0.004 s | 2 KBi |
#10 |
Incorrecto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.005 s | 4 KBi |
#12 |
Correcto
|
0.006 s | 6 KBi |
#13 |
Correcto
|
0.089 s | 67 KBi |
#14 |
Incorrecto
|
0.132 s | 2 KBi |
#15 |
Incorrecto
|
0.214 s | 2 KBi |
#include <bits/stdc++.h> using namespace std; void _print() { cerr << "]" << endl; } template<typename T, typename... V> void _print(T t, V... v) { cerr << t; if (sizeof...(v)) cerr << ", "; _print(v...); } #ifdef LOCAL #define dbg(x...) cerr << "[" << #x << "]: ["; _print(x) #else #define dbg(x...) #define endl '\n' #endif #define ll long long #define sz(x) int(x.size()) #define ii pair<int, int> #define ff first #define ss second struct clase { ii in, fi; bool operator < (const clase &o) const { return fi >= o.fi; } }; ii separar(string s) { ii x; x.ff = stoi(s.substr(0, 2)); x.ss = stoi(s.substr(3)); return x; } clase get_clase(string a, string b) { return {separar(a), separar(b)}; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); priority_queue<clase> pq; int n; cin >> n; for (int i = 0; i < n; ++i) { string a, b; cin >> a >> b; clase x = get_clase(a, b); if (sz(pq) && pq.top().fi <= x.in) pq.pop(); pq.push(x); } cout << sz(pq) << endl; return 0; }