Submission #2713906
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<map> #include<set> using namespace std; using ll = long long; ll dp[51][51]; ll comb(int n, int r) { if(n == r) return dp[n][r] = 1; if(r == 0) return dp[n][r] = 1; if(r == 1) return dp[n][r] = n; if(dp[n][r]) return dp[n][r]; return dp[n][r] = comb(n-1,r) + comb(n-1,r-1); } int main() { int n, a, b; cin >> n >> a >> b; vector<ll> v(n); map<ll, int> mp; for(int i = 0; i < n; i++) cin >> v[i], mp[v[i]]++; sort(v.begin(), v.end(), greater<ll>()); double ans = 0; set<ll, greater<ll> > st; for(int i = 0; i < a; i++) { ans += v[i]; st.insert(v[i]); } ans /= a; printf("%lf\n", ans); if(st.size() == 1) { ll sum = 0; for(int i = a; i <= min(mp[*st.begin()], b); i++) { sum += comb(mp[*st.begin()], i); } printf("%lld\n", sum); } else { auto iter = st.begin(); int num = a; for(int i = 0; i < st.size()-1; i++) { num -= mp[*iter]; ++iter; } printf("%lld\n", comb(mp[*iter], num)); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Maximum Average Sets |
User | yki25 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1239 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 |