# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
647237 | mr_robot_545 | Prosjek (COCI18_prosjek) | C++17 | 1 ms | 212 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.
// i love mancity
#include<bits/stdc++.h>
#include <stack>
#include <vector>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl "\n"
#define ll long long
#define f(a) for(int i=0;i<a;i++)
#define rf(a) for(int i=a-1;i>=0;i--)
#define w int t;cin>>t;while(t--)
#define all(v) v.begin(),v.end()
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define prev2pn(x) pow(2,floor(log2(x)))
#define MR_Robot iostream::sync_with_stdio(false);cin.tie(nullptr); \
cout.tie(nullptr);
#define arrRange(a , l , r) int _##a[(r-l)+1]; int* a= _##a-l;
#define ordered_set tree<int, null_type,less<int>, \
rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
int n;
void solve(){
cin>>n;
vector<int>v1(n),v2;
for (int i = 0; i <n ; ++i) {
cin>>v1[i];
}
sort(v1.begin(),v1.end());
double ans=v1[0];
for (int i = 1; i <n ; ++i) {
ans+=v1[i];
ans/=2.0;
}
cout<<fixed<<setprecision(6)<<ans<<endl;
}
int main() {
// MR_Robot
//#ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
//#endif
// w{
solve();
// }
return 0;
}
// QAQGDQAQhdfj
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |