Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <conio.h>
- #include <string>
- #include <math.h>
- #include <algorithm>
- #include <vector>
- #include <set>
- #include <map>
- #include <sstream>
- #include <queue>
- using namespace std;
- int main()
- {
- double n, P, prom;
- vector <double> s;
- cin >> n;
- cout.setf(ios::fixed);
- cout.precision(2);
- for (int i = 1; i <= n; i++)
- {
- cin >> prom;
- s.push_back(prom);
- }
- sort(s.begin(), s.end());
- P = s[s.size() - 1];
- for (int i = s.size() - 2; i >= 0; i--)
- P = 2 * sqrt(P*s[i]);
- cout << P;
- _getch();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement