Submission #2077266
Source Code Expand
#include<stdio.h> #include<vector> #include<algorithm> #include<math.h> #include<stdlib.h> #include<string> #include<iostream> #include<set> #include<map> #include<deque> using namespace std; typedef long long ll; typedef pair<ll, ll>pii; typedef pair<pii, ll>pi3; ll mod = 1000000007; int d[1000]; int main() { int n, k; scanf("%d%d", &n, &k); int maxi = 0; for (int i = 0; i < k; i++) { int z; scanf("%d", &z); maxi = max(maxi, z); } if (maxi * 2 - 1 <= n)printf("0\n"); else printf("%d\n", maxi + maxi - n - 1); }
Submission Info
Submission Time | |
---|---|
Task | B - K Cakes |
User | DEGwer |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 559 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &n, &k); ^ ./Main.cpp:25:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &z); ^
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 |