Submission #27228431
Source Code Expand
//#pragma GCC optimize ("O2")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
ll A[200000];
rep(i, N) cin >> A[i];
ll L = 0, R = 2e18;
while (L + 1 < R) {
ll wj = (L + R) / 2;
__int128 kei = 0;
rep(i, N) kei += min(wj, A[i]);
__int128 tmp = (__int128)wj * K;
if (kei >= tmp) L = wj;
else R = wj;
}
co(L);
Would you please return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | D - Project Planning |
| User | uzzy |
| Language | C++ (GCC 9.2.1) |
| Score | 400 |
| Code Size | 1014 Byte |
| Status | AC |
| Exec Time | 44 ms |
| Memory | 5216 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 400 / 400 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_00.txt, sample_01.txt, sample_02.txt |
| All | case_00.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt, case_16.txt, case_17.txt, case_18.txt, case_19.txt, case_20.txt, case_21.txt, case_22.txt, case_23.txt, case_24.txt, case_25.txt, sample_00.txt, sample_01.txt, sample_02.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| case_00.txt | AC | 44 ms | 5044 KiB |
| case_01.txt | AC | 41 ms | 5088 KiB |
| case_02.txt | AC | 39 ms | 5204 KiB |
| case_03.txt | AC | 43 ms | 5204 KiB |
| case_04.txt | AC | 42 ms | 5204 KiB |
| case_05.txt | AC | 21 ms | 4388 KiB |
| case_06.txt | AC | 34 ms | 4752 KiB |
| case_07.txt | AC | 16 ms | 3968 KiB |
| case_08.txt | AC | 28 ms | 4688 KiB |
| case_09.txt | AC | 26 ms | 4424 KiB |
| case_10.txt | AC | 17 ms | 3900 KiB |
| case_11.txt | AC | 34 ms | 4968 KiB |
| case_12.txt | AC | 22 ms | 4000 KiB |
| case_13.txt | AC | 38 ms | 4868 KiB |
| case_14.txt | AC | 33 ms | 5128 KiB |
| case_15.txt | AC | 17 ms | 4204 KiB |
| case_16.txt | AC | 27 ms | 4732 KiB |
| case_17.txt | AC | 32 ms | 4948 KiB |
| case_18.txt | AC | 8 ms | 3620 KiB |
| case_19.txt | AC | 39 ms | 4852 KiB |
| case_20.txt | AC | 34 ms | 5080 KiB |
| case_21.txt | AC | 37 ms | 5216 KiB |
| case_22.txt | AC | 35 ms | 5172 KiB |
| case_23.txt | AC | 2 ms | 3476 KiB |
| case_24.txt | AC | 3 ms | 3548 KiB |
| case_25.txt | AC | 2 ms | 3608 KiB |
| sample_00.txt | AC | 2 ms | 3480 KiB |
| sample_01.txt | AC | 2 ms | 3536 KiB |
| sample_02.txt | AC | 3 ms | 3608 KiB |