Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <math.h>
- #include <iomanip>
- using namespace std;
- int niz[10020];
- int main()
- {
- freopen("puberaks.10.in","r",stdin);
- int n,s1,s2,s,a;
- s1=0;
- s2=0;
- s=0;
- a=1;
- double izlaz=-151.1581;
- cin >> n ;
- for (int i = 0; i < n; i++)
- {
- cin >> niz[i];
- s+=niz[i];
- }
- sort(niz,niz+n);
- a=0;
- for (int i = 0; i < n-1 ; i++)
- {
- a++;
- s1=s1+niz[i];
- s2=s-s1;
- double x,y,z,z1;
- x=s1/(a);
- y=s2/(n-a);
- if (x>=y)z=x-y;
- else z=y-x;
- izlaz=max(izlaz,z);
- }
- printf("%.2lf", izlaz);
- //cout.setf(ios::fixed,ios::floatfield);
- //cout.precision(2);
- //cout << izlaz << endl;
- return 0;
- }
Add Comment
Please, Sign In to add comment