Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- int n, m, wynik=0, wynik2=0, a, b, x;
- int wew[1000005], zew[1000005];
- using namespace std;
- int main()
- {
- //ios_base::sync_with_stdio(0);
- //cin.tie(0);
- scanf ("%d%d", &n, &m);
- for (int i=1; i<=n; i++)
- {
- cin>>wew[i];
- cin>>zew[i];
- }
- a=wew[m];
- b=zew[m];
- x=m-1;
- for (int i=x; i!=0; i--)
- {
- if (zew[i]<=a || wew[i]>=b) continue;
- else {
- wynik++;
- a=min(a, wew[i]);
- b=max(b, zew[i]);
- }
- }
- a=wew[m];
- b=zew[m];
- x=m+1;
- for (int i=x; i<=n; i++)
- {
- if (zew[i]<=a || wew[i]>=b) continue;
- else {
- wynik2++;
- a=min(a, wew[i]);
- b=max(b, zew[i]);
- }
- }
- //cout<<wynik2<<endl;
- if (wynik<wynik2) printf ("%d", wynik);
- else printf ("%d", wynik2);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement