Submission #3225551
Source Code Expand
#include<iostream> #include<algorithm> #include<vector> #include<iomanip> #include<map> using namespace std; typedef long long ll; ll COM(ll n, ll k) { if (k < 0 || n < k) return 0; int64_t ret = 1; for (int64_t i = 1; i <= k; ++i) { ret *= n--; ret /= i; } return ret; } int main() { ll n, a, b; cin >> n >> a >> b; ll v[n]; for (int i = 0; i < n; i++) { cin >> v[i]; } sort(v, v + n); reverse(v, v + n); ll sum = 0; for (int i = 0; i < a; i++) { sum += v[i]; } map<ll, ll>mp1; map<ll, ll>mp2; printf("%lf\n", (double)sum / a); sum = 0; if (v[0] == v[a - 1]) { int num = 0; for (int i = 0; i < n; i++) { if (v[i] == v[0])num++; } for (int i = a; i <= b; i++) { sum += COM(num, i); } cout << sum << endl; } else { for (int i = 0; i < a; i++) { mp1[v[i]]++; } for (int i = 0; i < n; i++) { mp2[v[i]]++; } cout << COM(mp2[v[a - 1]], mp1[v[a - 1]]) << endl; } }
Submission Info
Submission Time | |
---|---|
Task | D - Maximum Average Sets |
User | sintan |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 981 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
sample_04.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |
subtask_1_12.txt | AC | 1 ms | 256 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |
subtask_1_14.txt | AC | 1 ms | 256 KB |
subtask_1_15.txt | AC | 1 ms | 256 KB |
subtask_1_2.txt | AC | 1 ms | 256 KB |
subtask_1_3.txt | AC | 1 ms | 256 KB |
subtask_1_4.txt | AC | 1 ms | 256 KB |
subtask_1_5.txt | AC | 1 ms | 256 KB |
subtask_1_6.txt | AC | 1 ms | 256 KB |
subtask_1_7.txt | AC | 1 ms | 256 KB |
subtask_1_8.txt | AC | 1 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |