fork download
copy 
  1. #include <iostream>
  2. #include <vector>
  3. #include <algorithm>
  4. #include <cmath>
  5. #include <climits>
  6. using namespace std;
  7.  
  8. #define endl '\n'
  9. #define ll long long
  10. #define pb push_back
  11. #define mp make_pair
  12. #define pii pair<int, int>
  13. #define vi vector<int>
  14. #define vl vector<long long>
  15.  
  16. const int MOD = 1e9 + 7;
  17.  
  18. int main() {
  19.     ios_base::sync_with_stdio(false);
  20.     cin.tie(NULL);
  21.  
  22.     int t;
  23.     cin >> t;
  24.  
  25.     while(t--) {
  26.         int n;
  27.         cin >> n;
  28.         int median = ceil(n / 2.0); // Use 2.0 instead of 2 to ensure floating-point division
  29.         int occurrences = 0;
  30.         vector<int> v(n);
  31.  
  32.         for(int i = 0; i < n; i++) {
  33.             cin >> v[i];
  34.         }
  35.  
  36.         sort(v.begin(), v.end());
  37.  
  38.  
  39.         for(int i = median-1; i < n; i++) {
  40.             if(v[i] == v[median-1]) // Adjust median index to 0-based indexing
  41.                 occurrences++;
  42.         }
  43.  
  44.         cout << occurrences << endl;
  45.     }
  46.  
  47.     return 0;
  48. }
  49.  
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
8
3
2 2 8
4
7 3 3 1
1
1000000000
5
5 5 5 4 5
6
2 1 2 3 1 4
2
1 2
2
1 1
4
5 5 5 5
stdout
copy 
1
2
1
3
2
1
2
3
https://ideone.com/YeeKjs
language:
C++ (gcc 8.3)
created:
36 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!