Advertisement
Guest User

Untitled

a guest
Feb 25th, 2018
74
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.01 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. int n, m, wynik=0, wynik2=0, a, b, x;
  3. int wew[1000005], zew[1000005];
  4. using namespace std;
  5.  
  6. int main()
  7. {
  8. //ios_base::sync_with_stdio(0);
  9. //cin.tie(0);
  10.  
  11. scanf ("%d%d", &n, &m);
  12.  
  13. for (int i=1; i<=n; i++)
  14. {
  15. cin>>wew[i];
  16. cin>>zew[i];
  17. }
  18.  
  19. a=wew[m];
  20. b=zew[m];
  21.  
  22. x=m-1;
  23.  
  24. for (int i=x; i!=0; i--)
  25. {
  26. if (zew[i]<=a || wew[i]>=b) continue;
  27. else {
  28. wynik++;
  29. a=min(a, wew[i]);
  30. b=max(b, zew[i]);
  31. }
  32. }
  33.  
  34. a=wew[m];
  35. b=zew[m];
  36. x=m+1;
  37. for (int i=x; i<=n; i++)
  38. {
  39. if (zew[i]<=a || wew[i]>=b) continue;
  40. else {
  41. wynik2++;
  42. a=min(a, wew[i]);
  43. b=max(b, zew[i]);
  44. }
  45. }
  46. //cout<<wynik2<<endl;
  47. if (wynik<wynik2) printf ("%d", wynik);
  48. else printf ("%d", wynik2);
  49.  
  50.  
  51. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement