Submission #4321710
Source Code Expand
// vvvvvvvvvvvv TEMPLATE vvvvvvvvvvvv #include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<ll, ll>; const ll linf = 1e18; const double eps = 1e-12, pi = acos(-1); #define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++) #define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--) #define REP(i,n) FOR(i,0,n) #define RREP(i,n) RFOR(i,0,n) #define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME #define each(i,a) for (auto&& i : a) #define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__) #define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__) #define pb push_back #define eb emplace_back #define all(a) begin(a),end(a) #define chmin(x,v) x = min(x, v) #define chmax(x,v) x = max(x, v) template<typename T> ll min(ll a, const T&& b) { return a < b ? a : b; } template<typename T> ll min(const T&& a, ll b) { return a < b ? a : b; } template<typename T> ll max(ll a, const T&& b) { return a > b ? a : b; } template<typename T> ll max(const T&& a, ll b) { return a > b ? a : b; } template<typename Head> void out(Head h) { cout << h << endl; } template<typename Head, typename... Tail>void out(Head h, Tail... t) { cout << h << " "; out(t...); } template<typename T> istream& operator>>(istream& is, vector<T>& v) { each(x,v) is >> x; return is; } template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) { rep(i,v.size()) { if (i) os << " "; os << v[i]; } return os; } ostream& operator<<(ostream& os, const vector<string>& v) { rep(i,v.size()) { if (i) os << endl; os << v[i]; } return os; } template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v) { rep(i,v.size()) { if (i) os << endl; os << v[i]; } return os; } template<typename T1, typename T2> ostream& operator<<(ostream& os, const pair<T1, T2>& p) { return os << "(" << p.first << ", " << p.second << ")"; } struct yes_no : std::numpunct<char> { string_type do_truename() const { return "Yes"; } string_type do_falsename() const { return "No"; } }; void solve(); int main() { ios::sync_with_stdio(false); cin.tie(0); locale loc(locale(), new yes_no); cout.imbue(loc); cout << fixed << setprecision(10) << boolalpha; solve(); } // ^^^^^^^^^^^^ TEMPLATE ^^^^^^^^^^^^ void solve() { ll n; cin >> n; vector<ll> d(n); cin >> d; sort(all(d)); ll sum = 0; rep(i, n) sum += d[i]; ll mx = sum; ll mn = max(0, d.back() - (sum - d.back())); cout << mx << endl; cout << mn << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 2点間距離の最大と最小 ( Maximum and Minimum ) |
User | drafear |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2504 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 |