Cod sursa(job #587560)
Utilizator | Andrei Mazareanu mazaandrei | Data | 5 mai 2011 09:25:37 |
---|---|---|---|
Problema | Avioane | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<stdio.h>
#include <algorithm>
using namespace std;
int i,j,n,a[100001],aux,s=0,l;
int main(){
freopen("avioane.in","r",stdin);
freopen("avioane.out","w",stdout);
scanf("%d", &n);
for(i=1;i<=n;++i) scanf("%d", &a[i]);
sort(a+1,a+n+1);
for(i=1;i<n;++i)
for(j=i+1;j<=n;++j){
if(a[i]==a[i-1]) break;
l=a[i]*(j-i)+a[j]*(n-j+1);
if(l>s) s=l;
}
printf("%d", s);
return 0;
}