oj.uz

답안 #647237

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
647237 2022-10-02T03:07:57 Z mr_robot_545 Prosjek (COCI18_prosjek) C++17
50 / 50
 1 ms 212 KB 
// 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

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct