oj.uz

답안 #959033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959033 2024-04-07T11:53:41 Z MilosMilutinovic Prosjek (COCI18_prosjek) C++14
50 / 50
 1 ms 600 KB 
#include<bits/stdc++.h>
 
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
 
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
 
ll readint(){
	ll x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int n;

int main(){
	n=readint();
	vector<double> vec;
	for(int i=1;i<=n;i++){
		int x=readint();
		vec.pb(x);
	}
	while(vec.size()>1){
		sort(vec.rbegin(),vec.rend());
		ld x=vec[vec.size()-1],y=vec[vec.size()-2];
		vec.pop_back();
		vec.pop_back();
		vec.pb((x+y)/2.00);
	}
	printf("%.6lf\n",vec[0]);
	return 0;
}

Subtask #1
50.0 / 50.0

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