Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- struct linie
- {
- int x, y, nr;
- };
- linie v[105];
- vector<int> smax;
- bool cmp(linie a, linie b)
- {
- return a.x < b.x;
- }
- bool cmp2(linie a, linie b)
- {
- return a.y < b.y;
- }
- int n, a[105];
- int main()
- {
- cin >> n;
- for(int i=1; i<=n; i++)
- cin >> v[i].x >> v[i].y;
- sort(v+1, v+n+1, cmp);
- for(int i=1; i<=n; i++)
- v[i].nr = i;
- int nr = 0;
- sort(v+1, v+1+n, cmp2);
- for(int i=1; i<=n; i++)
- a[++nr] = v[i].nr;
- for(int i=1; i<=n; i++)
- if(smax.empty() || a[i] >= smax.back())
- smax.push_back(a[i]);
- else
- {
- vector<int>::iterator it = upper_bound(smax.begin(), smax.end(), a[i]);
- *it = a[i];
- }
- cout << n - smax.size();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement