#249429 (C++14) No.67 よくある棒を切る問題 (1)

• 問題: No.67 よくある棒を切る問題 (1)
• ユーザー: akusyounin2412
• 提出日時: 2018-04-03 00:34:29
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 215 ms / 5,000 ms
• コード長: 1,829 bytes
• コンパイル時間: 1,258 ms
• コンパイル使用メモリ: 116,532 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-11-08 12:38:41
• 合計ジャッジ時間: 7,472 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	215 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	80 ms; 5,248 KB
testcase_03	AC	152 ms; 5,248 KB
testcase_04	AC	187 ms; 5,248 KB
testcase_05	AC	187 ms; 5,248 KB
testcase_06	AC	188 ms; 5,248 KB
testcase_07	AC	208 ms; 5,248 KB
testcase_08	AC	208 ms; 5,376 KB
testcase_09	AC	210 ms; 5,248 KB
testcase_10	AC	169 ms; 5,248 KB
testcase_11	AC	177 ms; 5,248 KB
testcase_12	AC	162 ms; 5,248 KB
testcase_13	AC	192 ms; 5,248 KB
testcase_14	AC	198 ms; 5,248 KB
testcase_15	AC	177 ms; 5,248 KB
testcase_16	AC	189 ms; 5,248 KB
testcase_17	AC	187 ms; 5,248 KB
testcase_18	AC	187 ms; 5,376 KB
testcase_19	AC	209 ms; 5,248 KB
testcase_20	AC	208 ms; 5,248 KB
testcase_21	AC	209 ms; 5,248 KB
testcase_22	AC	169 ms; 5,248 KB
testcase_23	AC	179 ms; 5,376 KB
testcase_24	AC	2 ms; 5,248 KB
testcase_25	AC	6 ms; 5,248 KB
testcase_26	AC	3 ms; 5,248 KB
testcase_27	AC	3 ms; 5,248 KB
testcase_28	AC	35 ms; 5,248 KB
testcase_29	AC	18 ms; 5,248 KB
testcase_30	AC	6 ms; 5,248 KB

ソースコード

# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
#include <stdio.h>
#include <stdlib.h>
#include <cstdint>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = std::numeric_limits<long long>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define debug(x) cerr<<#x<<": "<<x<<'\n'
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)
LL h, w, n, m, k, s, t, q, sum, last, cnt, ans,a[200010];
string str;
struct Edge { LL to, cost; };
vector<Edge>vec;
bool f;
char c;
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
int main() {
	cin >> n;
	rep(i, n)cin >> a[i];
	cin >> k;
	double l = 0, r = 1000000100;
	int i = 100;
	while (i > 0) {
		double mid = (l + r) / 2;
		LL ss = 0;
		rep(i, n)ss += a[i] / mid;
		if (ss < k)r = mid;
		else l = mid;
		i--;
	}
	printf("%.15f\n",  (l+r)/2);
	return 0;
}