# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
410673 | snasibov05 | Prosjek (COCI18_prosjek) | C++14 | 1 ms | 300 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <set>
using namespace std;
int main() {
int n; cin >> n;
multiset<double> st;
for (int i = 0; i < n; ++i){
int x; cin >> x;
st.insert(x*1.0);
}
while (st.size() > 1){
auto it1 = st.begin();
auto it2 = ++st.begin();
double k = (*it1 + *it2) / 2.0;
st.erase(it1);
st.erase(it2);
st.insert(k);
}
double ans = *st.begin();
cout.precision(6);
cout << fixed << ans << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |