1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
int mid1 = v[(n - 1) / 2];
int mid2 = v[n / 2];
int count = 0;
for (int x : v) {
if (x >= mid1 && x <= mid2) count++;
}
cout << mid1 << " " << count << " " << (mid2 - mid1 + 1) << "\n";
}
return 0;
}
|
