Submission #9702125
Source Code Expand
/* Author:zeke pass System Test! GET AC!! */ #include <iostream> #include <queue> #include <vector> #include <iostream> #include <vector> #include <string> #include <cassert> #include <algorithm> #include <functional> #include <cmath> #include <queue> #include <set> #include <stack> #include <deque> #include <map> #include <iomanip> #include <utility> #include <stack> #include <bitset> using ll = long long; using ld = long double; using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define all(x) (x).begin(), (x).end() #define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var)) #define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var)) #define Mp(a, b) make_pair((a), (b)) #define F first #define S second #define Icin(s) \ ll(s); \ cin >> (s); #define Scin(s) \ ll(s); \ cin >> (s); template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } typedef pair<ll, ll> P; typedef vector<ll> V; typedef vector<V> VV; typedef vector<P> VP; ll mod = 1e9 + 7; ll MOD = 1e9 + 7; ll INF = 1e18; int main() { cin.tie(0); ios::sync_with_stdio(false); ll n; cin >> n; V vec(n); rep(i, n) cin >> vec[i]; sort(all(vec)); cout << vec.back() << " "; ll k = lower_bound(all(vec), vec.back() / 2)-vec.begin(); ll s1 = vec[k]; if(k!=0){ if (abs(vec[k - 1] - vec.back() / 2) < abs(vec[k] - vec.back() / 2)){ s1 = vec[k - 1]; } if(s1==vec.back()){ s1=vec[vec.size()-2]; } } cout << s1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Binomial Coefficients |
User | zeke |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1875 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt |
All | even0.txt, even1.txt, float.txt, odd0.txt, odd1.txt, rnd_0.txt, rnd_1.txt, rnd_2.txt, rnd_3.txt, rnd_4.txt, rnd_5.txt, rnd_6.txt, rnd_7.txt, rnd_8.txt, rnd_9.txt, sample1.txt, sample2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
even0.txt | AC | 17 ms | 1024 KB |
even1.txt | AC | 17 ms | 1024 KB |
float.txt | AC | 17 ms | 1024 KB |
odd0.txt | AC | 17 ms | 1024 KB |
odd1.txt | AC | 17 ms | 1024 KB |
rnd_0.txt | AC | 16 ms | 1024 KB |
rnd_1.txt | AC | 14 ms | 896 KB |
rnd_2.txt | AC | 15 ms | 1024 KB |
rnd_3.txt | AC | 14 ms | 896 KB |
rnd_4.txt | AC | 12 ms | 768 KB |
rnd_5.txt | AC | 17 ms | 1024 KB |
rnd_6.txt | AC | 14 ms | 896 KB |
rnd_7.txt | AC | 13 ms | 896 KB |
rnd_8.txt | AC | 15 ms | 896 KB |
rnd_9.txt | AC | 15 ms | 896 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |