Cod sursa(job #586799)
Utilizator | cosmin Macovei test9 | Data | 2 mai 2011 22:07:00 |
---|---|---|---|
Problema | Avioane | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("avioane.in");
ofstream g("avioane.out");
int a[100001],v,n,sm,i,j,x,x1;
void citire(){
f>>n;
for(i=1;i<=n;++i)
f>>a[i];
sort(a+1,a+n+1);
for(i=1;i<=n;++i){
v=(n-i+1)*a[i];
if(a[i]!=a[i-1]){
x1=0;
for(j=i;j<=n;++j)
if(a[j]!=a[j-1]){
x=(n-j+1)*(a[j]-a[i]);
if(x>x1) x1=x;
}
v+=x1;
if(sm<v) sm=v;
}
}
}
int main(){
citire();
g<<sm<<'\n';
g.close();
return 0;
}