| Task: | Binge watching |
| Sender: | aalto25b_008 |
| Submission time: | 2025-09-10 16:43:33 +0300 |
| Language: | C++ (C++17) |
| Status: | COMPILE ERROR |
Compiler report
In file included from /usr/include/c++/11/bits/stl_algobase.h:71,
from /usr/include/c++/11/bits/char_traits.h:39,
from /usr/include/c++/11/ios:40,
from /usr/include/c++/11/ostream:38,
from /usr/include/c++/11/iostream:39,
from input/code.cpp:1:
/usr/include/c++/11/bits/predefined_ops.h: In instantiation of 'constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std::vector<int> > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std::vector<int> > >; _Compare = main()::<lambda(const std::pair<int, int>&, const std::pair<int, int>&)>]':
/usr/include/c++/11/bits/stl_algo.h:82:17: required from 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std...Code
#include <iostream>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> movies(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
movies[i].push_back(a);
movies[i].push_back(b);
}
sort(movies.begin(), movies.end(), [](const pair<int,int>& a, const pair<int,int>& b) {
return a.second < b.second;
});
int end = movies[0][1];
int nbr = 0;
for (int i = 1; i < n; i++) {
if (movies[i][0] >= end) {
end = movies[i][1];
} else {
nbr++;
}
}
cout << n - nbr;
return 0;
}