AcWing 4818. 奶牛大学
原题链接
简单
作者:
MyPower
,
2023-01-01 20:03:45
,
所有人可见
,
阅读 139
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100100;
int s[N];
/*
先排序 1 4 6 6
*/
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i ++)
scanf("%d", &s[i]);
sort(s, s + n);
long long sum = 0, max = 0;
int idex = 0;
for(int i = 0; i < n; i++)
{
sum = (long long)s[i] * (n - i);//
if(sum > max)
{
max = sum;
idex = s[i];
}
}
printf("%lld %d", max, idex);
return 0;
}