牛客小白月赛119 A
#include <bits/stdc++.h>
using namespace std;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f64 = long double;
using i128 = __int128_t;
using u128 = __uint128_t;
void solve() {
auto get = [&](i64 f) -> i64 {
i64 res = 0, mx = 0, mn = 1e18;
for (int i = 1; i <= 5; i++) {
i64 x;
cin >> x;
res += x;
mx = max(x, mx);
mn = min(x, mn);
}
return res + f * mx + (1 ^ f) * mn;
};
cout << (get(1) > get(0) ? "YES\n" : "NO\n");
return;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int T = 1;
// cin >> T;
while (T--) {
solve();
}
return 0;
}#牛客创作赏金赛#
using namespace std;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f64 = long double;
using i128 = __int128_t;
using u128 = __uint128_t;
void solve() {
auto get = [&](i64 f) -> i64 {
i64 res = 0, mx = 0, mn = 1e18;
for (int i = 1; i <= 5; i++) {
i64 x;
cin >> x;
res += x;
mx = max(x, mx);
mn = min(x, mn);
}
return res + f * mx + (1 ^ f) * mn;
};
cout << (get(1) > get(0) ? "YES\n" : "NO\n");
return;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int T = 1;
// cin >> T;
while (T--) {
solve();
}
return 0;
}#牛客创作赏金赛#
全部评论
相关推荐
点赞 评论 收藏
分享
点赞 评论 收藏
分享