Unija

/// Alen Antonelli, https://www.hackerrank.com/contests/contest-carinosito/challenges
/// http://hsin.hr/coci/archive/2016_2017/contest5_tasks.pdf
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>

using namespace std;

int main()
{
    int n;
    cin>>n;

    vector<int> v (n);
    for(int i=0; i<n; i++)
        cin>>v[i];

    sort(v.rbegin(), v.rend());

    double ST = 0;
    for(int i=0; i<n; i++)
        ST+=v[i];

    double sum=0, a, b;
    double ma, mb;
    for(int i=0; i<n; i++)
    {
        sum+=v[i];

        a = (double) (i+1)*100/n;
        b = (sum*100/ST);

        if ( (b-a)>(mb-ma) )
            ma=a, mb=b;
        else break;
    }
    cout << setprecision(16) <<ma<<endl<<mb;

    return 0;
}