Language: C++

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#include<regex>
#include<bitset>
#include<complex>
#include<chrono>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
 
using namespace std;
 
template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << "\n"; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " <<to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

ll n,a,b;
vector<double>v;

bool C(double mid,int k){
  double sum=0;
  rep(i,k)sum+=v[i]-mid;
  return sum>=0;
}

#define int64_t ll
template< typename T >
T binomial(int64_t N, int64_t K) {
  if(K < 0 || N < K) return 0;
  T ret = 1;
  for(T i = 1; i <= K; ++i) {
    ret *= N--;
    ret /= i;
  }
  return ret;
}

void solve(){
  cin>>n>>a>>b;
  v.resize(n);
  rep(i,n)cin>>v[i];
  sort(v.rbegin(),v.rend());
  ll c=1;
  double l=1.0,r=1e15+1;
  rep(i,100){
    double mid=(l+r)/2.0;
    if(C(mid,a))l=mid;
    else r=mid;
  }
  int pos=0;
  map<double,ll>mp;
  while(pos<n){
    if(!mp.count(v[pos])&&mp.size()+1>a)break;
    mp[v[pos++]]++;
  }
  vector<ll>x;
  for(auto e:mp){
    x.pb(e.second);
  }
  sort(x.rbegin(),x.rend());
  int y=-1;
  rep(i,b){
    if(v[0]!=v[i]){
      y=i;
      break;
    }
  }
  if(y>=0){
    c=0;
    for(ll i=a;i<=b;++i){
      c+=binomial<ll>(n,i);
    }
  }
  else for(auto e:mp)c+=binomial<ll>(n,e);
  cout<<l<<"\n";
  cout<<c<<"\n";
}

int main(){
	ios::sync_with_stdio(false);
  cin.tie(0);
	cout<<fixed<<setprecision(15);
	solve();
	return 0;
}


Compiler output:
a.cc: In function 'void solve()':
a.cc:191:40: error: cannot convert 'std::pair<const double, long long int>' to 'll' {aka 'long long int'}
  191 |   else for(auto e:mp)c+=binomial<ll>(n,e);
      |                                        ^
      |                                        |
      |                                        std::pair<const double, long long int>
a.cc:145:31: note:   initializing argument 2 of 'T binomial(ll, ll) [with T = long long int; ll = long long int]'
  145 | T binomial(int64_t N, int64_t K) {
      |                               ^