Advertisement
MohamedAbdel3al

A. Oath of the Night's Watch

Dec 2nd, 2021
65
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.01 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define cin(vec) for(auto& i : vec) cin >> i
  6. #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
  7. #define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
  8. #define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
  9. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << " " << s << "\n";
  10. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  11. #define fixed(n) fixed << setprecision(n)
  12. //#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  13. #define fill(vec, value) memset(vec, value, sizeof(vec));
  14. #define Num_of_Digits(n) ((int)log10(n)+1)
  15. #define all(vec) vec.begin(),vec.end()
  16. #define rall(vec) vec.rbegin(),vec.rend()
  17. #define sz(x) int(x.size())
  18. #define TC int t; cin >> t; while(t--)
  19. #define fi first
  20. #define se second
  21. #define Pair pair < int, int >
  22. #define ll long long
  23. #define ull unsigned long long
  24. #define Mod 1'000'000'007
  25. #define OO 2'000'000'000
  26. #define EPS 1e-9
  27. #define PI acos(-1)
  28. #define imin INT_MIN
  29. #define imax INT_MAX
  30. #define getline(s) getline(cin >> ws , s)
  31. #define pb(x) push_back(x)
  32. #define to_decimal(bin) stoi(bin, nullptr, 2)
  33.  
  34. void Code_Crush(){
  35. ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  36. #ifndef ONLINE_JUDGE
  37. freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  38. #endif
  39. Time
  40. }
  41.  
  42. void solve(){
  43. }
  44.  
  45. int main (){
  46. Code_Crush();
  47. int t = 1;
  48. //cin >> t;
  49. while(t--){
  50. int n;
  51. cin >> n;
  52. int cnt = 0;
  53. vector < int > stewards(n);
  54. if(sz(stewards) <= 2) return cout << 0, 0;
  55. for(int i = 0; i < n && cin >> stewards[i]; i++);
  56. sort(all(stewards));
  57. for(int i = 1; i < n - 1; i++){
  58. if(stewards[i] > stewards[i - 1] && stewards[i] < stewards[i + 1]) cnt++;
  59. }
  60. cout << cnt;
  61. }
  62. return 0;
  63. }
  64.  
  65.  
  66.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement