Submission #1891589
Source Code Expand
# include <iostream> # include <algorithm> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <utility> # include <stack> # include <queue> # include <list> # include <bitset> # include <complex> #include<limits.h> #include<unordered_map> #include<unordered_set> #include<deque> #include<cstdio> typedef long long int ll; using namespace std; #define FOR(i,a,n) for(int i=(ll)a;i<(ll)n;++i) #define TFOR(i,n)FOR(i,0,n) #define ALL(x) x.begin(),x.end() const int INF = 1LL << 30; const ll LLINF = 1LL << 60; int main() { int maxp = 0; int k, t, num[110]; cin >> k >> t; TFOR(i, t)cin >> num[i]; std::sort(num, num + t); num[t - 1]--; if(t>1)cout << max(0,abs(num[t - 1] - num[t - 2]) - 1) << endl; else cout << num[0] - 1 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - K Cakes |
User | mukadenodaiou |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 877 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
1_003.txt | AC | 1 ms | 256 KB |
1_004.txt | WA | 1 ms | 256 KB |
1_005.txt | WA | 1 ms | 256 KB |
1_006.txt | WA | 1 ms | 256 KB |
1_007.txt | WA | 1 ms | 256 KB |
1_008.txt | WA | 1 ms | 256 KB |
1_009.txt | WA | 1 ms | 256 KB |