Submission #2325761
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <map> #include <set> #include <vector> #include <stack> #include <queue> #include <bitset> #include <algorithm> #include <numeric> #include <functional> using namespace std; #define Rep(b, e, i) for(int i = b; i <= e; i++) #define Repr(e, b, i) for(int i = e; i >= b; i--) #define rep(n, i) Rep(0, n-1, i) #define repr(n, i) Repr(n-1, 0, i) #define all(v) (v).begin(), (v).end() #define pb(x) push_back(x) #define uniq(x) (x).erase(unique(all(x)),(x).end()) typedef long long ll; typedef pair<ll, ll> llP; typedef pair<int, int> intP; typedef std::priority_queue<int> IntPrioQueue; //Z->A typedef std::priority_queue<int, std::vector<int>, std::greater<int> > IntReversePrioQueue; //A->Z const int MAX = 200000; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const int INF = 1<<29; const int MOD = 1000000007; vector <int> v; void solve(void){ int N, sum = 0; cin >> N; rep(N, i) { int A; cin >> A; v.pb(A); sum += A; } cout << sum << endl; sort(all(v)); cout << max(0, 2*v[N-1] - sum) << endl; } int main(void){ solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 2点間距離の最大と最小 ( Maximum and Minimum ) |
User | sifi_border |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1274 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 02_rnd2_20.txt, 02_rnd2_21.txt, 02_rnd2_22.txt, 02_rnd2_23.txt, 02_rnd2_24.txt, 02_rnd2_25.txt, 02_rnd2_26.txt, 02_rnd2_27.txt, 02_rnd2_28.txt, 02_rnd2_29.txt, 03_max_00.txt, 03_max_01.txt, 03_max_02.txt, 03_max_03.txt, 03_max_04.txt, 03_max_05.txt, 03_max_06.txt, 03_max_07.txt, 03_max_08.txt, 03_max_09.txt, 04_maxret_01.txt, 04_maxret_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
00_sample_03.txt | AC | 1 ms | 256 KB |
00_sample_04.txt | AC | 1 ms | 256 KB |
00_sample_05.txt | AC | 1 ms | 256 KB |
01_rnd_00.txt | AC | 1 ms | 256 KB |
01_rnd_01.txt | AC | 1 ms | 256 KB |
01_rnd_02.txt | AC | 1 ms | 256 KB |
01_rnd_03.txt | AC | 1 ms | 256 KB |
01_rnd_04.txt | AC | 1 ms | 256 KB |
01_rnd_05.txt | AC | 1 ms | 256 KB |
01_rnd_06.txt | AC | 1 ms | 256 KB |
01_rnd_07.txt | AC | 1 ms | 256 KB |
01_rnd_08.txt | AC | 1 ms | 256 KB |
01_rnd_09.txt | AC | 1 ms | 256 KB |
01_rnd_10.txt | AC | 1 ms | 256 KB |
01_rnd_11.txt | AC | 1 ms | 256 KB |
01_rnd_12.txt | AC | 1 ms | 256 KB |
01_rnd_13.txt | AC | 1 ms | 256 KB |
01_rnd_14.txt | AC | 1 ms | 256 KB |
01_rnd_15.txt | AC | 1 ms | 256 KB |
02_rnd2_00.txt | AC | 1 ms | 256 KB |
02_rnd2_01.txt | AC | 1 ms | 256 KB |
02_rnd2_02.txt | AC | 1 ms | 256 KB |
02_rnd2_03.txt | AC | 1 ms | 256 KB |
02_rnd2_04.txt | AC | 1 ms | 256 KB |
02_rnd2_05.txt | AC | 1 ms | 256 KB |
02_rnd2_06.txt | AC | 1 ms | 256 KB |
02_rnd2_07.txt | AC | 1 ms | 256 KB |
02_rnd2_08.txt | AC | 1 ms | 256 KB |
02_rnd2_09.txt | AC | 1 ms | 256 KB |
02_rnd2_10.txt | AC | 1 ms | 256 KB |
02_rnd2_11.txt | AC | 1 ms | 256 KB |
02_rnd2_12.txt | AC | 1 ms | 256 KB |
02_rnd2_13.txt | AC | 1 ms | 256 KB |
02_rnd2_14.txt | AC | 1 ms | 256 KB |
02_rnd2_15.txt | AC | 1 ms | 256 KB |
02_rnd2_16.txt | AC | 1 ms | 256 KB |
02_rnd2_17.txt | AC | 1 ms | 256 KB |
02_rnd2_18.txt | AC | 1 ms | 256 KB |
02_rnd2_19.txt | AC | 1 ms | 256 KB |
02_rnd2_20.txt | AC | 1 ms | 256 KB |
02_rnd2_21.txt | AC | 1 ms | 256 KB |
02_rnd2_22.txt | AC | 1 ms | 256 KB |
02_rnd2_23.txt | AC | 1 ms | 256 KB |
02_rnd2_24.txt | AC | 1 ms | 256 KB |
02_rnd2_25.txt | AC | 1 ms | 256 KB |
02_rnd2_26.txt | AC | 1 ms | 256 KB |
02_rnd2_27.txt | AC | 1 ms | 256 KB |
02_rnd2_28.txt | AC | 1 ms | 256 KB |
02_rnd2_29.txt | AC | 1 ms | 256 KB |
03_max_00.txt | AC | 1 ms | 256 KB |
03_max_01.txt | AC | 1 ms | 256 KB |
03_max_02.txt | AC | 1 ms | 256 KB |
03_max_03.txt | AC | 1 ms | 256 KB |
03_max_04.txt | AC | 1 ms | 256 KB |
03_max_05.txt | AC | 1 ms | 256 KB |
03_max_06.txt | AC | 1 ms | 256 KB |
03_max_07.txt | AC | 1 ms | 256 KB |
03_max_08.txt | AC | 1 ms | 256 KB |
03_max_09.txt | AC | 1 ms | 256 KB |
04_maxret_01.txt | AC | 1 ms | 256 KB |
04_maxret_02.txt | AC | 1 ms | 256 KB |