Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <algorithm>
- using namespace std;
- int main()
- {
- //ifstream cin ("input.txt");
- //ofstream cout ("output.txt");
- long long n, a[1000002], s=0, sr=0, nm=0, nb=0, sum=0;
- cin >> n;
- for (int i=0; i<n; i++)
- {
- scanf ("%i", &a[i]);
- }
- for (int i=0; i<n; i++)
- {
- s+=a[i];
- sr=s/n;
- }
- int Max=*max_element (a, a+n);
- int Min=*min_element (a, a+n);
- for (int i=0; i<n; i++)
- {
- if (a[i]>sr)
- nb++;
- else
- if (a[i]<sr)
- nm++;
- else
- sum+=a[i];
- }
- sum+=Max*nb;
- sum+=Min*nm;
- cout << sum;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement