Submission #1172681
Source Code Expand
#include <cstdio> #include <iostream> #include <algorithm> #include <string> #include <vector> #include <queue> #include <set> #include <map> #include <cmath> using namespace std; typedef pair<int, int> P; #define rep(i, n) for (int i=0; i<(n); i++) #define all(c) (c).begin(), (c).end() #define _1 first #define _2 second #define pb push_back #define INF 1145141919 #define MOD 1000000007 int K, T; int A[100]; signed main() { ios::sync_with_stdio(false); cin.tie(0); cin >> K >> T; rep(i, T) cin >> A[i]; int mx = *max_element(A, A+T); int A = mx, B = K - mx; if (B >= A-1) { cout << 0 << "\n"; } else { cout << A-1-B << "\n"; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - K Cakes |
User | funcsr |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 711 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
1_003.txt | AC | 1 ms | 256 KB |
1_004.txt | AC | 1 ms | 256 KB |
1_005.txt | AC | 1 ms | 256 KB |
1_006.txt | AC | 1 ms | 256 KB |
1_007.txt | AC | 1 ms | 256 KB |
1_008.txt | AC | 1 ms | 256 KB |
1_009.txt | AC | 1 ms | 256 KB |