problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
int main() {
int n, l, sum = 0, mx = 0;
cin >> n;
rep(i, n) {
cin >> l;
sum += l;
mx = max(mx, l);
}
if (sum < l * 2) {
cout << "Yes";
} else {
cout << "No";
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
int main() {
int n, l, sum = 0, mx = 0;
cin >> n;
rep(i, n) {
cin >> l;
sum += l;
mx = max(mx, l);
}
if (sum <= mx * 2) {
cout << "No";
} else {
cout << "Yes";
}
}
| [
"literal.string.change",
"io.output.change"
] | 935,577 | 935,575 | u983711104 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vl l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
ll sum = 0;
rep(i, n - 1) sum += l[i];
if (sum < l[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vl l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
ll sum = 0;
rep(i, n - 1) sum += l[i];
if (sum > l[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,589 | 935,590 | u386131832 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
}
sort(l.begin(), l.end());
if (l[n - 1] < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
}
sort(l.begin(), l.end());
if (2 * l[n - 1] < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 935,591 | 935,592 | u573433204 | cpp |
p03136 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1012345678;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int N;
cin >> N;
int l[1000];
int M = 0;
rep(i, N) {
cin >> l[i];
M = max(l[i], M);
}
int sum = 0;
rep(i, N) { sum += l[i]; }
sum -= M * 2;
if (sum > M)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1012345678;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int main() {
int N;
cin >> N;
int l[1000];
int M = 0;
rep(i, N) {
cin >> l[i];
M = max(l[i], M);
}
int sum = 0;
rep(i, N) { sum += l[i]; }
sum -= M;
if (sum > M)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operation.binary.remove"
] | 935,598 | 935,599 | u950174376 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
sort(A, A + N);
int sm = 0;
rep(i, N - 1) sm += A[i];
if (sm < A[N - 1])
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
int A[N];
rep(i, N) cin >> A[i];
sort(A, A + N);
int sm = 0;
rep(i, N - 1) sm += A[i];
if (sm > A[N - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 935,600 | 935,601 | u882620594 | cpp |
p03136 | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
int n, h[100005];
ll dp[100005];
int main() {
long N;
std::cin >> N;
std::vector<long> L(N);
for (int i = 0; i < N; i++) {
std::cin >> L[i];
}
long max;
max = 0;
for (int i = 0; i < N; i++) {
if (max < L[i]) {
max = L[i];
}
}
long sum;
sum = 0;
int flag;
flag = 0;
for (int i = 0; i < N; i++) {
if (L[i] != max || flag == 1) {
sum += L[i];
flag = 1;
}
}
if (max > sum) {
printf("Yes\n");
} else {
printf("No\n");
}
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (int i = 0; i < x; i++)
#define repn(i, x) for (int i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
int n, h[100005];
ll dp[100005];
int main() {
long N;
std::cin >> N;
std::vector<long> L(N);
for (int i = 0; i < N; i++) {
std::cin >> L[i];
}
long max;
max = 0;
for (int i = 0; i < N; i++) {
if (max < L[i]) {
max = L[i];
}
}
long sum;
sum = 0;
int flag;
flag = 0;
for (int i = 0; i < N; i++) {
if (L[i] != max || flag == 1) {
// if(L[i] != max){
sum += L[i];
} else {
flag = 1;
}
}
if (max < sum) {
printf("Yes\n");
} else {
printf("No\n");
}
} | [
"control_flow.branch.else.add",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,602 | 935,603 | u069521477 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int N;
vector<int> L(N);
rep(i, N) cin >> L.at(i);
sort(L.begin(), L.end());
int sum = 0;
rep(i, N - 1) sum += L.at(i);
if (sum > L.at(N - 1))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
int N;
cin >> N;
vector<int> L(N);
rep(i, N) cin >> L.at(i);
sort(L.begin(), L.end());
int sum = 0;
rep(i, N - 1) sum += L.at(i);
if (sum > L.at(N - 1))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [] | 935,604 | 935,605 | u089241640 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int dp[100];
//最大公約数
int gcd(int x, int y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
//最小公倍数
int lcm(int x, int y) { return x * y / gcd(x, y); }
//フィボナッチ数列
//配列dpを-1で初期化する
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
//階乗計算(factorial)
int fact(int n) {
if (n = 1)
return 1;
return n * fact(n - 1);
}
//累乗計算(Exponentiation)
// x**y
ll expo(int x, int y) {
ll ans = 1;
rep(i, y) { ans *= x; }
return ans;
}
//桁数
int keta(ll x) {
if (x == 0)
return 1;
int res = 0;
while (x) {
x /= 10;
res++;
}
return res;
}
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int sum = 0;
rep(i, n - 1) { sum += l[i]; }
if (sum > l[n])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int dp[100];
//最大公約数
int gcd(int x, int y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
//最小公倍数
int lcm(int x, int y) { return x * y / gcd(x, y); }
//フィボナッチ数列
//配列dpを-1で初期化する
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
//階乗計算(factorial)
int fact(int n) {
if (n = 1)
return 1;
return n * fact(n - 1);
}
//累乗計算(Exponentiation)
// x**y
ll expo(int x, int y) {
ll ans = 1;
rep(i, y) { ans *= x; }
return ans;
}
//桁数
int keta(ll x) {
if (x == 0)
return 1;
int res = 0;
while (x) {
x /= 10;
res++;
}
return res;
}
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int sum = 0;
rep(i, n - 1) { sum += l[i]; }
if (sum > l[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 935,606 | 935,607 | u363936720 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int dp[100];
//最大公約数
int gcd(int x, int y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
//最小公倍数
int lcm(int x, int y) { return x * y / gcd(x, y); }
//フィボナッチ数列
//配列dpを-1で初期化する
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
//階乗計算(factorial)
int fact(int n) {
if (n = 1)
return 1;
return n * fact(n - 1);
}
//累乗計算(Exponentiation)
// x**y
ll expo(int x, int y) {
ll ans = 1;
rep(i, y) { ans *= x; }
return ans;
}
//桁数
int keta(ll x) {
if (x == 0)
return 1;
int res = 0;
while (x) {
x /= 10;
res++;
}
return res;
}
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int sum = 0;
rep(i, n - 1) { sum += l[i]; }
if (sum >= l[n])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int dp[100];
//最大公約数
int gcd(int x, int y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
//最小公倍数
int lcm(int x, int y) { return x * y / gcd(x, y); }
//フィボナッチ数列
//配列dpを-1で初期化する
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
//階乗計算(factorial)
int fact(int n) {
if (n = 1)
return 1;
return n * fact(n - 1);
}
//累乗計算(Exponentiation)
// x**y
ll expo(int x, int y) {
ll ans = 1;
rep(i, y) { ans *= x; }
return ans;
}
//桁数
int keta(ll x) {
if (x == 0)
return 1;
int res = 0;
while (x) {
x /= 10;
res++;
}
return res;
}
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int sum = 0;
rep(i, n - 1) { sum += l[i]; }
if (sum > l[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,608 | 935,607 | u363936720 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i, sum = 0, maxi = 0;
vector<int> vec(n);
for (i = 0; i < n; i++) {
cin >> vec.at(i);
maxi = max(maxi, vec.at(i));
sum += vec.at(i);
}
if (sum - maxi < maxi) {
cout << "Yes";
} else {
cout << "No";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int i, sum = 0, maxi = 0;
vector<int> vec(n);
for (i = 0; i < n; i++) {
cin >> vec.at(i);
maxi = max(maxi, vec.at(i));
sum += vec.at(i);
}
if (sum - maxi > maxi) {
cout << "Yes";
} else {
cout << "No";
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,609 | 935,610 | u130651752 | cpp |
p03136 | #include <iostream>
using namespace std;
int a[100];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int najduza = a[0];
for (int i = 0; i < n; ++i) {
if (najduza < a[i])
najduza = a[i];
}
int sum = 0;
for (int i = 0; i < n; ++i) {
sum = sum + a[i];
}
sum = sum - najduza;
if (najduza < sum)
cout << "No";
else
cout << "Yes";
} | #include <iostream>
using namespace std;
int a[100];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int najduza = a[0];
for (int i = 0; i < n; ++i) {
if (najduza < a[i])
najduza = a[i];
}
int sum = 0;
for (int i = 0; i < n; ++i) {
sum = sum + a[i];
}
sum = sum - najduza;
if (najduza < sum)
cout << "Yes";
else
cout << "No";
} | [
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 935,623 | 935,624 | u212144411 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
vector<int> l(n);
rep(i, n) cin >> l[i];
int sum = 0;
int m = 1;
rep(i, n) {
sum += l[i];
m = max(m, l[i]);
}
int res = sum - m;
if (res > m)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
int sum = 0;
int m = 1;
rep(i, n) {
sum += l[i];
m = max(m, l[i]);
}
int res = sum - m;
if (res > m)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [] | 935,627 | 935,628 | u816145694 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N - 1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N - 1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
struct mll {
static ll MOD;
ll val;
mll(ll v = 0) : val(v % MOD) {
if (val < 0)
val += MOD;
}
mll operator-() const { return -val; }
mll operator+(const mll &b) const { return val + b.val; }
mll operator-(const mll &b) const { return val - b.val; }
mll operator*(const mll &b) const { return val * b.val; }
mll operator/(const mll &b) const { return mll(*this) /= b; }
mll operator+(ll b) const { return *this + mll(b); }
mll operator-(ll b) const { return *this - mll(b); }
mll operator*(ll b) const { return *this * mll(b); }
friend mll operator+(ll a, const mll &b) { return b + a; }
friend mll operator-(ll a, const mll &b) { return -b + a; }
friend mll operator*(ll a, const mll &b) { return b * a; }
mll &operator+=(const mll &b) {
val = (val + b.val) % MOD;
return *this;
}
mll &operator-=(const mll &b) {
val = (val + MOD - b.val) % MOD;
return *this;
}
mll &operator*=(const mll &b) {
val = (val * b.val) % MOD;
return *this;
}
mll &operator/=(const mll &b) {
ll c = b.val, d = MOD, u = 1, v = 0;
while (d) {
ll t = c / d;
c -= t * d;
swap(c, d);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
mll &operator+=(ll b) { return *this += mll(b); }
mll &operator-=(ll b) { return *this -= mll(b); }
mll &operator*=(ll b) { return *this *= mll(b); }
mll &operator/=(ll b) { return *this /= mll(b); }
bool operator==(const mll &b) { return val == b.val; }
bool operator!=(const mll &b) { return val != b.val; }
bool operator==(ll b) { return *this == mll(b); }
bool operator!=(ll b) { return *this != mll(b); }
friend bool operator==(ll a, const mll &b) { return mll(a) == b.val; }
friend bool operator!=(ll a, const mll &b) { return mll(a) != b.val; }
friend ostream &operator<<(ostream &os, const mll &a) { return os << a.val; }
friend istream &operator>>(istream &is, mll &a) { return is >> a.val; }
static mll Combination(ll a, ll b) {
chmin(b, a - b);
if (b < 0)
return mll(0);
mll c = 1;
rep(i, b) c *= a - i;
rep(i, b) c /= i + 1;
return c;
}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
}
} fast; // cin,cout高速化のおまじない＋桁数指定
ll mll::MOD = (ll)(1e9 + 7); // 998244353ll;
int main() {
ll N;
cin >> N;
vector<ll> L(N);
ll maxL = 0;
ll sum = 0;
rep(i, N) {
cin >> L[i];
chmax(maxL, L[i]);
sum += L[i];
}
bool result = sum - maxL < maxL ? true : false;
if (result == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N - 1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N - 1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
struct mll {
static ll MOD;
ll val;
mll(ll v = 0) : val(v % MOD) {
if (val < 0)
val += MOD;
}
mll operator-() const { return -val; }
mll operator+(const mll &b) const { return val + b.val; }
mll operator-(const mll &b) const { return val - b.val; }
mll operator*(const mll &b) const { return val * b.val; }
mll operator/(const mll &b) const { return mll(*this) /= b; }
mll operator+(ll b) const { return *this + mll(b); }
mll operator-(ll b) const { return *this - mll(b); }
mll operator*(ll b) const { return *this * mll(b); }
friend mll operator+(ll a, const mll &b) { return b + a; }
friend mll operator-(ll a, const mll &b) { return -b + a; }
friend mll operator*(ll a, const mll &b) { return b * a; }
mll &operator+=(const mll &b) {
val = (val + b.val) % MOD;
return *this;
}
mll &operator-=(const mll &b) {
val = (val + MOD - b.val) % MOD;
return *this;
}
mll &operator*=(const mll &b) {
val = (val * b.val) % MOD;
return *this;
}
mll &operator/=(const mll &b) {
ll c = b.val, d = MOD, u = 1, v = 0;
while (d) {
ll t = c / d;
c -= t * d;
swap(c, d);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
mll &operator+=(ll b) { return *this += mll(b); }
mll &operator-=(ll b) { return *this -= mll(b); }
mll &operator*=(ll b) { return *this *= mll(b); }
mll &operator/=(ll b) { return *this /= mll(b); }
bool operator==(const mll &b) { return val == b.val; }
bool operator!=(const mll &b) { return val != b.val; }
bool operator==(ll b) { return *this == mll(b); }
bool operator!=(ll b) { return *this != mll(b); }
friend bool operator==(ll a, const mll &b) { return mll(a) == b.val; }
friend bool operator!=(ll a, const mll &b) { return mll(a) != b.val; }
friend ostream &operator<<(ostream &os, const mll &a) { return os << a.val; }
friend istream &operator>>(istream &is, mll &a) { return is >> a.val; }
static mll Combination(ll a, ll b) {
chmin(b, a - b);
if (b < 0)
return mll(0);
mll c = 1;
rep(i, b) c *= a - i;
rep(i, b) c /= i + 1;
return c;
}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
}
} fast; // cin,cout高速化のおまじない＋桁数指定
ll mll::MOD = (ll)(1e9 + 7); // 998244353ll;
int main() {
ll N;
cin >> N;
vector<ll> L(N);
ll maxL = 0;
ll sum = 0;
rep(i, N) {
cin >> L[i];
chmax(maxL, L[i]);
sum += L[i];
}
bool result = (sum - maxL) > maxL ? true : false;
if (result == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 935,629 | 935,630 | u572472538 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int n, s, arr[11], sum;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
sort(arr + 1, arr + 12);
if (arr[10] < sum - arr[10]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int n, s, arr[11], sum;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
sum += arr[i];
}
sort(arr + 1, arr + 11);
if (arr[10] < sum - arr[10]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 935,633 | 935,634 | u851275071 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum;
int ma = -1000;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
ma = max(ma, a);
}
sum -= ma;
if (sum > ma) {
cout << "Yes\n";
} else {
cout << "No\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int ma = -1000;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
ma = max(ma, a);
}
sum -= ma;
if (sum > ma) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
| [
"variable_declaration.value.change"
] | 935,635 | 935,636 | u918039777 | cpp |
p03136 | // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
#define kiriage(a, b) ((a) + (b)-1) / (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
int n;
cin >> n;
vi v(n);
rep(i, n) cin >> v[i];
vsort(v);
int sum = 0;
rep(i, n - 1) sum += v[i];
if (v[sz(v)] < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| // include
// ------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <math.h>
#include <vector>
using namespace std;
// func
// ------------------------------------------------
int CalcSumOfDigit(int n); // 各桁の和を計算する。
string upper(string str); // 英字を大文字に変換する。
string lower(string str); // 英字を小文字に変換する。
// define
// ------------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define sz(a) int((a).size())
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repe(i, n) for (int(i) = 0; (i) <= (n); (i)++)
#define vsort(v) sort((v).begin(), (v).end())
#define rvsort(v) sort(rall((v)))
#define vi vector<int>
#define GCD(a, b) __gcd((a), (b))
#define LCM(a, b) (a) / GCD((a), (b)) * (b)
#define kiriage(a, b) ((a) + (b)-1) / (b)
const int INF = 1e9;
// code
// ------------------------------------------------
int main() {
int n;
cin >> n;
vi v(n);
rep(i, n) cin >> v[i];
vsort(v);
int sum = 0;
rep(i, n - 1) sum += v[i];
if (v[n - 1] < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
// funcの実体
// ------------------------------------------------
int CalcSumOfDigit(int n) {
int s = 0;
while (n) {
s += n % 10;
n = n / 10;
}
return s;
}
string upper(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (97 <= *itr && *itr <= 122) {
*itr = *itr - 32;
}
}
return str;
}
string lower(string str) {
for (auto itr = str.begin(); itr != str.end(); itr++) {
if (65 <= *itr && *itr <= 90) {
*itr = *itr + 32;
}
}
return str;
}
| [
"control_flow.branch.if.condition.change"
] | 935,639 | 935,640 | u610897920 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum, longest = 0;
int l;
for (int i = 0; i < n; i++) {
cin >> l;
sum += l;
longest = max(longest, l);
}
if (longest < sum - longest) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int longest = 0;
int l;
for (int i = 0; i < n; i++) {
cin >> l;
sum += l;
longest = max(longest, l);
}
if (longest < sum - longest) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"variable_declaration.add"
] | 935,643 | 935,644 | u176218583 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int S = 0;
for (int i = 0; i < N; i++) {
S += L[i];
}
if (L[N] < S) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int S = 0;
for (int i = 0; i < N - 1; i++) {
S += L[i];
}
if (L[N - 1] < S) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 935,645 | 935,646 | u016183710 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.rbegin(), a.rend());
if (a.at(0) < accumulate(a.begin() + 1, a.end(), 0))
cout << "YES";
else
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.rbegin(), a.rend());
if (a.at(0) < accumulate(a.begin() + 1, a.end(), 0))
cout << "Yes";
else
cout << "No";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,647 | 935,648 | u582940224 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.rbegin(), a.rend());
if (a.at(0) > accumulate(a.begin() + 1, a.end(), 0))
cout << "YES";
else
cout << "NO";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.rbegin(), a.rend());
if (a.at(0) < accumulate(a.begin() + 1, a.end(), 0))
cout << "Yes";
else
cout << "No";
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,651 | 935,648 | u582940224 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define Fast \
ios_base::sync_with_stdio(0); \
cin.tie(0), cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout << "aise" << endl
#define pb push_back
#define mp make_pair
#define ll long long
#define mset(v, a) memset(v, a, sizeof(v))
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define ff first
#define ss second
#define pi acos(-1.0)
#define mxN 2010
#define inf 1e9
#define MOD 1000000007
int main() {
ll n, sum = 0;
vector<ll> v;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
v.pb(x);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (ll i = 1; i < n; i++)
sum += v[i];
if (v[0] > sum)
cout << "Yes";
else
cout << "No";
}
| #include <bits/stdc++.h>
using namespace std;
#define Fast \
ios_base::sync_with_stdio(0); \
cin.tie(0), cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w", stdout)
#define aise cout << "aise" << endl
#define pb push_back
#define mp make_pair
#define ll long long
#define mset(v, a) memset(v, a, sizeof(v))
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define ff first
#define ss second
#define pi acos(-1.0)
#define mxN 2010
#define inf 1e9
#define MOD 1000000007
int main() {
ll n, sum = 0;
cin >> n;
vector<ll> v;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
v.pb(x);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (ll i = 1; i < n; i++)
sum += v[i];
if (v[0] < sum)
cout << "Yes";
else
cout << "No";
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,652 | 935,653 | u568082675 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
}
sort(L.begin(), L.end());
if (L[N - 1] > sum - L[N - 1])
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
}
sort(L.begin(), L.end());
if (L[N - 1] < sum - L[N - 1])
cout << "Yes";
else
cout << "No";
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,656 | 935,657 | u109191542 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l, mx = 0, sum = 0;
while (n > 0) {
cin >> l;
sum += l;
mx = max(mx, l);
n--;
}
cout << (sum > mx * 2 ? "Yes" : "NO");
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l, mx = 0, sum = 0;
while (n > 0) {
cin >> l;
sum += l;
mx = max(mx, l);
n--;
}
cout << (sum > mx * 2 ? "Yes" : "No");
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,658 | 935,659 | u018372223 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += L.at(i);
}
if (L.at(N - 1) > sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += L.at(i);
}
if (L.at(N - 1) < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,660 | 935,661 | u018466367 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int L[101];
int max = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
if (max < L[i]) {
max = L[i];
}
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
}
if (max < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
};
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int L[101];
int max = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
if (max < L[i]) {
max = L[i];
}
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum += L[i];
}
if (max < sum - max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
};
| [
"control_flow.branch.if.condition.change"
] | 935,662 | 935,663 | u595145483 | cpp |
p03136 | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
#define lli long long
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int sum = 0;
for (int i = 0; i < n - 1; i++)
sum += a[i];
if (sum >= a[n - 1])
cout << "Yes";
else
cout << "No";
return 0;
} | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
#define lli long long
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int sum = 0;
for (int i = 0; i < n - 1; i++)
sum += a[i];
if (sum > a[n - 1])
cout << "Yes";
else
cout << "No";
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,668 | 935,669 | u476054945 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define REP(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
int l[n];
int sum = 0;
int lmax = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
lmax = max(lmax, l[i]);
}
if (sum - lmax < lmax)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define REP(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
int l[n];
int sum = 0;
int lmax = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
lmax = max(lmax, l[i]);
}
if (sum - lmax > lmax)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,672 | 935,673 | u057810841 | cpp |
p03135 | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << t / x;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int t, x;
cin >> t >> x;
cout << t * 1.0 / x;
return 0;
}
| [
"expression.operation.binary.add"
] | 935,674 | 935,675 | u388087096 | cpp |
p03136 | #include <iostream>
#include <vector>
using namespace std;
int find_max(vector<int> v) {
int max = 0;
for (vector<int>::size_type i = 0; i != v.size(); i++) {
if (v[i] > max)
max = v[i];
}
return max;
}
int main() {
int n, i = 0;
cin >> n;
vector<int> body;
int m;
while (i < n && cin >> m) {
body.push_back(m);
i++;
}
int sum;
for (vector<int>::size_type i = 0; i != body.size(); i++)
sum += body[i];
if ((sum - find_max(body)) > find_max(body))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int find_max(vector<int> v) {
int max = 0;
for (vector<int>::size_type i = 0; i != v.size(); i++) {
if (v[i] > max)
max = v[i];
}
return max;
}
int main() {
int n, i = 0;
cin >> n;
vector<int> body;
int m;
while (i < n && cin >> m) {
body.push_back(m);
i++;
}
int sum = 0;
for (vector<int>::size_type i = 0; i != body.size(); i++)
sum += body[i];
if ((sum - find_max(body)) > find_max(body))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"variable_declaration.value.change"
] | 935,676 | 935,677 | u863370423 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n;
int i = 0;
int b, c;
int a[10];
int sum = 0;
cin >> n;
while (n >= 3 && n <= 10) {
while (i <= n - 1) {
cin >> a[i];
i++;
}
b = c = 0;
while (c <= n - 1) {
if (a[b] < a[c]) {
b = c;
}
c++;
}
c = 0;
while (c <= n - 1) {
if (c != b)
sum = sum + a[c];
c++;
}
break;
}
if (sum > a[b])
cout << "yes" << endl;
else
cout << "no" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
int i = 0;
int b, c;
int a[10];
int sum = 0;
cin >> n;
while (n >= 3 && n <= 10) {
while (i <= n - 1) {
cin >> a[i];
i++;
}
b = c = 0;
while (c <= n - 1) {
if (a[b] < a[c]) {
b = c;
}
c++;
}
c = 0;
while (c <= n - 1) {
if (c != b)
sum = sum + a[c];
c++;
}
break;
}
if (sum > a[b])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,678 | 935,679 | u863370423 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n, l, s = 0, m = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l;
m = max(m, l);
s += l;
}
cout << ((m * 2 > s) ? "Yes" : "No");
}
| #include <iostream>
using namespace std;
int main() {
int n, l, s = 0, m = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l;
m = max(m, l);
s += l;
}
cout << ((m * 2 < s) ? "Yes" : "No");
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 935,680 | 935,681 | u353919145 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long i, n, m, d, s = 0;
vector<long long> a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
s += m;
a.push_back(m);
}
d = *max_element(a.begin(), a.end());
if ((s - d) <= d)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long i, n, m, d, s = 0;
vector<long long> a;
cin >> n;
for (i = 0; i < n; i++) {
cin >> m;
s += m;
a.push_back(m);
}
d = *max_element(a.begin(), a.end());
if ((s - d) <= d)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,682 | 935,683 | u353919145 | cpp |
p03136 | #include "./bits/stdc++.h"
using namespace std;
int n;
int main() {
cin >> n;
int A[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A, A + n);
int num;
int max = A[n - 1];
for (int i = 0; i < n - 1; i++) {
num += A[i];
}
if (num > max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include "./bits/stdc++.h"
using namespace std;
int n;
int main() {
cin >> n;
int A[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A, A + n);
int sum = 0;
int max = A[n - 1];
for (int i = 0; i < n - 1; i++) {
sum += A[i];
}
if (sum > max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"variable_declaration.name.change",
"variable_declaration.value.change",
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 935,690 | 935,691 | u230246348 | cpp |
p03136 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.begin(), a.end())
#define Srep(n) for (int i = 0; i < (n); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Lrep(i, a, n) for (int i = (a); i < (n); i++)
#define Brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define rep2nd(n, m) Srep(n) Lrep(j, 0, m)
#define vi vector<int>
#define vi64 vector<int64_t>
#define vvi vector<vector<int>>
#define vvi64 vector<vector<int64_t>>
using namespace std;
int main() {
int n;
cin >> n;
vi l(n);
Srep(n) cin >> l[i];
Vsort(l);
int sum;
Srep(n - 1) sum += l[i];
cout << (sum >= l[n - 1] ? "Yes" : "No") << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.begin(), a.end())
#define Srep(n) for (int i = 0; i < (n); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Lrep(i, a, n) for (int i = (a); i < (n); i++)
#define Brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define rep2nd(n, m) Srep(n) Lrep(j, 0, m)
#define vi vector<int>
#define vi64 vector<int64_t>
#define vvi vector<vector<int>>
#define vvi64 vector<vector<int64_t>>
using namespace std;
int main() {
int n;
cin >> n;
vi l(n);
Srep(n) cin >> l[i];
Vsort(l);
int sum = 0;
Srep(n - 1) sum += l[i];
cout << (sum > l[n - 1] ? "Yes" : "No") << endl;
} | [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 935,692 | 935,693 | u424661377 | cpp |
p03136 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.begin(), a.end())
#define Srep(n) for (int i = 0; i < (n); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Lrep(i, a, n) for (int i = (a); i < (n); i++)
#define Brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define rep2nd(n, m) Srep(n) Lrep(j, 0, m)
#define vi vector<int>
#define vi64 vector<int64_t>
#define vvi vector<vector<int>>
#define vvi64 vector<vector<int64_t>>
using namespace std;
int main() {
int n;
cin >> n;
vi l(n);
Srep(n) cin >> l[i];
Vsort(l);
int sum;
Srep(n - 1) sum += l[i];
cout << (sum > l[n - 1] ? "Yes" : "No") << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define Vsort(a) sort(a.begin(), a.end())
#define Vreverse(a) reverse(a.begin(), a.end())
#define Srep(n) for (int i = 0; i < (n); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Lrep(i, a, n) for (int i = (a); i < (n); i++)
#define Brep(n) for (int bit = 0; bit < (1 << n); bit++)
#define rep2nd(n, m) Srep(n) Lrep(j, 0, m)
#define vi vector<int>
#define vi64 vector<int64_t>
#define vvi vector<vector<int>>
#define vvi64 vector<vector<int64_t>>
using namespace std;
int main() {
int n;
cin >> n;
vi l(n);
Srep(n) cin >> l[i];
Vsort(l);
int sum = 0;
Srep(n - 1) sum += l[i];
cout << (sum > l[n - 1] ? "Yes" : "No") << endl;
} | [
"variable_declaration.value.change"
] | 935,694 | 935,693 | u424661377 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
vector<int> arr(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
int maxi = *max_element(arr.begin(), arr.end());
sum = sum - (2 * maxi);
if (maxi >= sum)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
int n;
cin >> n;
vector<int> arr(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
int maxi = *max_element(arr.begin(), arr.end());
sum = sum - maxi;
if (maxi >= sum)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | [] | 935,695 | 935,696 | u273824262 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int64_t MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
void YN(bool x) {
if (x)
cout << "Yes";
else
cout << "No";
}
int main() {
int N, T;
cin >> N;
vector<int> S(N);
rep(i, N) {
cin >> S.at(i);
T += S.at(i);
}
bool ok = true;
rep(i, N) {
if (S[i] >= T - S[i])
ok = false;
}
YN(ok);
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int64_t MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
void YN(bool x) {
if (x)
cout << "Yes";
else
cout << "No";
}
int main() {
int N, T = 0;
cin >> N;
vector<int> S(N);
rep(i, N) {
cin >> S.at(i);
T += S.at(i);
}
bool ok = true;
rep(i, N) {
if (S[i] >= T - S[i])
ok = false;
}
YN(ok);
}
| [
"variable_declaration.value.change"
] | 935,697 | 935,698 | u153686508 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; ++i)
cin >> A[i];
int max = 0, sum = 0;
for (int i = 0; i < N; ++i) {
if (A[i] > max)
max = i;
sum += A[i];
}
if (sum - max > max)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; ++i)
cin >> A[i];
int max = 0, sum = 0;
for (int i = 0; i < N; ++i) {
if (A[i] > max)
max = A[i];
sum += A[i];
}
if (sum - max > max)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [] | 935,699 | 935,700 | u521712919 | cpp |
p03136 | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
int n, L[100];
cin >> n;
int ma = 0;
for (int i = 0; i < n; i++) {
cin >> L[i];
ma = max(ma, L[i]);
}
int sum = 0;
for (int i = 0; i < n; i++)
sum += L[i];
if (ma < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <ctype.h>
#include <iostream>
#include <math.h>
#include <string.h>
#include <string>
using namespace std;
int main() {
int n, L[100];
cin >> n;
int ma = 0;
for (int i = 0; i < n; i++) {
cin >> L[i];
ma = max(ma, L[i]);
}
int sum = 0;
for (int i = 0; i < n; i++)
sum += L[i];
if (ma < sum - ma)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"control_flow.branch.if.condition.change"
] | 935,701 | 935,702 | u337018543 | cpp |
p03136 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n + 1; i++)
#define PI 3.14159265359
#define EPS 0.0000000001
#define MOD 1000000007
// cout << std::fixed << std::setprecision(15) << y << endl;
int main() {
ll N;
cin >> N;
ll sumL = 0;
ll Lmax = 0;
ll L[N];
rep(i, N) {
cin >> L[i];
Lmax = max(Lmax, L[i]);
sumL += L[i];
}
if (sumL - Lmax < Lmax) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define REP(i, n) for (ll i = 1; i < n + 1; i++)
#define PI 3.14159265359
#define EPS 0.0000000001
#define MOD 1000000007
// cout << std::fixed << std::setprecision(15) << y << endl;
int main() {
ll N;
cin >> N;
ll sumL = 0;
ll Lmax = 0;
ll L[N];
rep(i, N) {
cin >> L[i];
Lmax = max(Lmax, L[i]);
sumL += L[i];
}
if (sumL - Lmax > Lmax) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,706 | 935,707 | u332258971 | cpp |
p03136 | // AtCoder template
// sabaより胡蝶しのぶさんの方が可愛いのではないか？
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int l[n];
rep(i, n) cin >> l[i];
int lmax = 0, lsum = 0;
rep(i, n) {
lmax = max(lmax, l[i]);
lsum += l[i];
}
if (lsum > 2 * lmax)
cout << "Yes";
else
"No";
} | // AtCoder template
// sabaより胡蝶しのぶさんの方が可愛いのではないか？
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int l[n];
rep(i, n) cin >> l[i];
int lmax = 0, lsum = 0;
rep(i, n) {
lmax = max(lmax, l[i]);
lsum += l[i];
}
if (lsum > 2 * lmax)
cout << "Yes";
else
cout << "No";
} | [
"io.output.change"
] | 935,716 | 935,717 | u083190434 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int s = 0;
rep(i, n - 1) { s += l[i]; }
if (l[n - 1] < s) {
cout << "YES" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int s = 0;
rep(i, n - 1) { s += l[i]; }
if (l[n - 1] < s) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,718 | 935,719 | u924451152 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L.begin(), L.end());
reverse(L.begin(), L.end());
int ans = 0;
for (int i = 1; i < N + 1; i++) {
ans += L[i];
}
if (L[0] < ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(110);
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L.begin(), L.end());
reverse(L.begin(), L.end());
int ans = 0;
for (int i = 1; i < N + 1; i++) {
ans += L[i];
}
if (L[0] < ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [] | 935,720 | 935,721 | u531523517 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
int sum = 0;
int max_num = 0;
rep(i, n) {
int tmp_num;
cin >> tmp_num;
max_num = max(max_num, tmp_num);
sum += tmp_num;
}
if (max_num < sum / 2) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
int sum = 0;
int max_num = 0;
rep(i, n) {
int tmp_num;
cin >> tmp_num;
max_num = max(max_num, tmp_num);
sum += tmp_num;
}
if (max_num < sum - max_num) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [] | 935,722 | 935,723 | u596311864 | cpp |
p03136 | #include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
VI l(n);
rep(i, n) { l.at(i); }
sort(l.begin(), l.end());
int sum = 0;
rep(i, n) { sum += l.at(i); }
if (sum > l.at(n - 1) * 2) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
} |
#include <bits/stdc++.h>
#include <math.h>
#include <stdio.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n;
cin >> n;
VI l(n);
rep(i, n) { cin >> l.at(i); }
sort(l.begin(), l.end());
int sum = 0;
rep(i, n) { sum += l.at(i); }
if (sum > l.at(n - 1) * 2) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| [
"expression.operation.binary.add"
] | 935,724 | 935,725 | u927053131 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
int max = 0;
for (int i = 0; i < sizeof(L) / sizeof(*L); i++) {
cin >> L[i];
if (max < L[i]) {
max = L[i];
}
}
int sum = 0;
for (int i = 0; i < sizeof(L) / sizeof(*L); i++) {
sum += L[i];
}
sum -= max;
if (max < sum) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
int max = 0;
for (int i = 0; i < sizeof(L) / sizeof(*L); i++) {
cin >> L[i];
if (max < L[i]) {
max = L[i];
}
}
int sum = 0;
for (int i = 0; i < sizeof(L) / sizeof(*L); i++) {
sum += L[i];
}
sum -= max;
if (max < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,738 | 935,739 | u274195948 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i, N; i++)
cin >> L.at(i);
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L.at(i);
if (L.at(N - 1) >= sum)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L.at(i);
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L.at(i);
if (L.at(N - 1) >= sum)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| [] | 935,744 | 935,745 | u660112829 | cpp |
p03136 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int max = 0, sum = 0;
for (int i = 0; i < N; ++i) {
int L;
cin >> L;
sum += L;
if (max < L)
max = L;
}
sum -= max;
if (max * 2 < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int max = 0, sum = 0;
for (int i = 0; i < N; ++i) {
int L;
cin >> L;
sum += L;
if (max < L)
max = L;
}
sum -= max;
if (max < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operation.binary.remove"
] | 935,749 | 935,750 | u323542775 | cpp |
p03136 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[n];
}
int max = a[0];
int sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= max) {
sum += max;
max = a[i];
} else {
sum += a[i];
}
}
if (max >= sum) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = a[0];
int sum = 0;
for (int i = 1; i < n; i++) {
if (a[i] >= max) {
sum += max;
max = a[i];
} else {
sum += a[i];
}
}
if (max >= sum) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 935,751 | 935,752 | u977490411 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, big = 0, ans = 0;
cin >> n;
vector<long> l(n);
for (long i = 0; i < n; i++) {
cin >> l[i];
if (big <= l[i]) {
big = l[i];
}
ans = ans + l[i];
}
if (ans - big >= big) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, big = 0, ans = 0;
cin >> n;
vector<long> l(n);
for (long i = 0; i < n; i++) {
cin >> l[i];
if (big <= l[i]) {
big = l[i];
}
ans = ans + l[i];
}
if (ans - big > big) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,755 | 935,756 | u636605529 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, big = 0, ans = 0;
cin >> n;
vector<long> l(n);
for (long i = 0; i < n; i++) {
cin >> l[i];
if (big <= l[i]) {
big = l[i];
}
ans = ans + l[i];
}
if (ans - big >= big) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, big = 0, ans = 0;
cin >> n;
vector<long> l(n);
for (long i = 0; i < n; i++) {
cin >> l[i];
if (big <= l[i]) {
big = l[i];
}
ans = ans + l[i];
}
if (ans - big > big) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 935,757 | 935,756 | u636605529 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c = 0;
int d = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (c < b) {
d += c;
c = b;
} else {
d += b;
}
}
if (d < c) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
int c = 0;
int d = 0;
cin >> a;
for (int i = 0; i < a; i++) {
cin >> b;
if (c < b) {
d += c;
c = b;
} else {
d += b;
}
}
if (d <= c) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,761 | 935,762 | u357752130 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define LAST(x) x[x.size() - 1]
#define ALL(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
#define CEIL(a, b) ((a + b - 1) / b)
int GCD(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return GCD(b, a % b);
}
int LCM(int a, int b) // assuming a,b >= 1
{
return a * b / GCD(a, b);
}
double LOG(int a, int b) { return log(b) / log(a); }
inline bool BETWEEN(int x, int min, int max) {
if (min <= x && x <= max)
return true;
else
return false;
}
using namespace std;
#pragma endregion
signed main() {
int N, sum = 0;
cin >> N;
vector<int> L;
rep(i, N) {
cin >> L[i];
sum += L[i];
}
sort(ALL(L));
if (2 * LAST(L) < sum)
cout << "Yes";
else
cout << "No";
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define LAST(x) x[x.size() - 1]
#define ALL(x) (x).begin(), (x).end()
#define swap(a, b) (a += b, b = a - b, a -= b)
#define CEIL(a, b) ((a + b - 1) / b)
int GCD(int a, int b) // assuming a,b >= 1
{
if (a < b)
swap(a, b);
if (b == 0)
return a;
if (a % b == 0)
return b;
return GCD(b, a % b);
}
int LCM(int a, int b) // assuming a,b >= 1
{
return a * b / GCD(a, b);
}
double LOG(int a, int b) { return log(b) / log(a); }
inline bool BETWEEN(int x, int min, int max) {
if (min <= x && x <= max)
return true;
else
return false;
}
using namespace std;
#pragma endregion
signed main() {
int N, sum = 0;
cin >> N;
vector<int> L(N);
rep(i, N) {
cin >> L[i];
sum += L[i];
}
sort(ALL(L));
if (2 * LAST(L) < sum)
cout << "Yes";
else
cout << "No";
} | [] | 935,765 | 935,766 | u545364250 | cpp |
p03136 | // 117 B - Polygon 2019/02/03
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long int int64;
typedef unsigned long long uint64;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int __check = 0;
rep(i, n - 1) __check += l[i];
if (l[n] <= __check)
puts("Yes");
else
puts("No");
} | // 117 B - Polygon 2019/02/03
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long int int64;
typedef unsigned long long uint64;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int __check = 0;
rep(i, n - 1) __check += l[i];
if (l[n - 1] < __check)
puts("Yes");
else
puts("No");
} | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 935,767 | 935,768 | u699111690 | cpp |
p03136 | // 117 B - Polygon 2019/02/03
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long int int64;
typedef unsigned long long uint64;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int __check = 0;
rep(i, n - 1) __check += l[i];
if (l[n] < __check)
puts("Yes");
else
puts("No");
} | // 117 B - Polygon 2019/02/03
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long int int64;
typedef unsigned long long uint64;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int __check = 0;
rep(i, n - 1) __check += l[i];
if (l[n - 1] < __check)
puts("Yes");
else
puts("No");
} | [
"control_flow.branch.if.condition.change"
] | 935,769 | 935,768 | u699111690 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += A.at(i);
}
if (sum > A.at(N)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += A.at(i);
}
if (sum > A.at(N - 1)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 935,774 | 935,775 | u373661220 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define long long long
int main(void) {
ll n;
cin >> n;
vector<ll> l(n);
for (auto &e : l)
cin >> e;
sort(l.begin(), l.end());
ll s = 0;
for (auto &e : l)
s += e;
cout << (s - l[n - 1] < l[n - 1] ? "Yes" : "No") << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define long long long
int main(void) {
ll n;
cin >> n;
vector<ll> l(n);
for (auto &e : l)
cin >> e;
sort(l.begin(), l.end());
ll s = 0;
for (auto &e : l)
s += e;
cout << (s - l[n - 1] > l[n - 1] ? "Yes" : "No") << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 935,778 | 935,779 | u056944756 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int L;
int max = 0;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> L;
if (max < L)
max = L;
sum += L;
}
sum -= max;
if (sum > max)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int L;
int max = 0;
int sum = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> L;
if (max < L)
max = L;
sum += L;
}
sum -= max;
if (sum > max)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [] | 935,780 | 935,781 | u695653147 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int nums[N] = {0};
for (int i = 0; i < N; i++) {
cin >> nums[i];
}
int maxlen = 0;
int maxind = 0;
for (int i = 0; i < N; i++) {
if (nums[i] > maxlen) {
maxlen = nums[i];
maxind = i;
}
}
int sumval = 0;
for (int i = 0; i < N; i++) {
if (i == maxind)
continue;
sumval += nums[i];
}
if (sumval < maxlen)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int nums[N] = {0};
for (int i = 0; i < N; i++) {
cin >> nums[i];
}
int maxlen = 0;
int maxind = 0;
for (int i = 0; i < N; i++) {
if (nums[i] > maxlen) {
maxlen = nums[i];
maxind = i;
}
}
int sumval = 0;
for (int i = 0; i < N; i++) {
if (i == maxind)
continue;
sumval += nums[i];
}
// cout << maxlen << ", "<< sumval<< endl;
if (maxlen < sumval)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 935,784 | 935,785 | u685800831 | cpp |
p03136 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
}
for (int i = 0; i < N; i++) {
if (sum / 2 <= L[i]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
}
for (int i = 0; i < N; i++) {
if (sum <= L[i] * 2) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 935,786 | 935,787 | u162328834 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
int sum = 0;
int le = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
le = max(le, a);
}
if (le < sum - le) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int sum = 0;
int le = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
le = max(le, a);
}
if (le < sum - le) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [] | 935,788 | 935,789 | u559578080 | cpp |
p03136 | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <forward_list>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
// Others
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int dy[8] = {1, 1, 1, 0, 0, -1, -1, -1};
// LOVE NyantakoGG https://www.youtube.com/channel/UC6XdFs8T6Ei54O0FYl3PVVA
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
sort(data.begin(), data.end());
int L = 0;
for (int i = 0; i < N - 1; i++) {
L += data[i];
}
if (L < data[N - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <forward_list>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
// Others
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int dy[8] = {1, 1, 1, 0, 0, -1, -1, -1};
// LOVE NyantakoGG https://www.youtube.com/channel/UC6XdFs8T6Ei54O0FYl3PVVA
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
sort(data.begin(), data.end());
int L = 0;
for (int i = 0; i < N - 1; i++) {
L += data[i];
}
if (L > data[N - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,798 | 935,799 | u685346012 | cpp |
p03136 | // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <forward_list>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
// Others
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int dy[8] = {1, 1, 1, 0, 0, -1, -1, -1};
// LOVE NyantakoGG https://www.youtube.com/channel/UC6XdFs8T6Ei54O0FYl3PVVA
using namespace std;
int main() {
int N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
sort(data.begin(), data.end());
int L = 0;
for (int i = 0; i < N - 1; i++) {
L += data[i];
}
if (L < data[N - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| // C
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdalign>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
// C++
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <chrono>
#include <complex>
#include <condition_variable>
#include <deque>
#include <forward_list>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
// Others
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const int dy[8] = {1, 1, 1, 0, 0, -1, -1, -1};
// LOVE NyantakoGG https://www.youtube.com/channel/UC6XdFs8T6Ei54O0FYl3PVVA
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(N);
for (int i = 0; i < N; i++) {
cin >> data[i];
}
sort(data.begin(), data.end());
int L = 0;
for (int i = 0; i < N - 1; i++) {
L += data[i];
}
if (L > data[N - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,800 | 935,799 | u685346012 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N;
int P = 0;
int M = 0;
for (int i = 0; i < N; i++) {
cin >> L;
P += L;
M = max(M, L);
}
cout << (P < M * 2 ? "Yes" : "No");
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L;
cin >> N;
int P = 0;
int M = 0;
for (int i = 0; i < N; i++) {
cin >> L;
P += L;
M = max(M, L);
}
cout << (P > M * 2 ? "Yes" : "No");
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 935,801 | 935,802 | u424374375 | cpp |
p03136 |
#include <iostream>
using namespace std;
int main() {
int N;
int L[10];
cin >> N;
int max_L = 0, iofmax, sum_L = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
sum_L += L[i];
if (max_L < L[i]) {
max_L = L[i];
iofmax == i;
}
}
if ((sum_L - max_L) > max_L) {
cout << "yes" << endl;
} else {
cout << "no" << endl;
}
// cout << L[2] << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
int L[10];
cin >> N;
int max_L = 0, iofmax, sum_L = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
sum_L += L[i];
if (max_L < L[i]) {
max_L = L[i];
iofmax == i;
}
}
if ((sum_L - max_L) > max_L) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,805 | 935,806 | u643111543 | cpp |
p03136 | //
// Created by Myabu on 2020/01/25.
//
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; ++i) {
sum += L[i];
// cout<<L[i]<<endl;
}
// cout<<sum<<endl;
if (L[N - 1] <= sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | //
// Created by Myabu on 2020/01/25.
//
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; ++i) {
sum += L[i];
// cout<<L[i]<<endl;
}
// cout<<sum<<endl;
if (L[N - 1] < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,814 | 935,815 | u149583407 | cpp |
p03136 | //
// Created by Myabu on 2020/01/25.
//
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; ++i) {
sum += L[i];
}
if (L[N - 1] > sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | //
// Created by Myabu on 2020/01/25.
//
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; ++i) {
sum += L[i];
// cout<<L[i]<<endl;
}
// cout<<sum<<endl;
if (L[N - 1] < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,816 | 935,815 | u149583407 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 1; i < n; i++) {
a[i] += a[i - 1];
}
cout << (a[n - 1] > 2 * a[n - 2] ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 1; i < n; i++) {
a[i] += a[i - 1];
}
cout << (a[n - 1] < 2 * a[n - 2] ? "Yes" : "No") << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 935,817 | 935,818 | u198693633 | cpp |
p03136 | #include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (int i = 0; i < n - 1; i++) {
A[n - 1] -= A[i];
}
if (A[n - 1] > 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
} | #include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (int i = 0; i < n - 1; i++) {
A[n - 1] -= A[i];
}
if (A[n - 1] >= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,819 | 935,820 | u207948013 | cpp |
p03136 | #include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (int i = 0; i < n - 1; i++) {
A[n - 1] -= A[i];
}
if (A[n - 1] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
for (int i = 0; i < n - 1; i++) {
A[n - 1] -= A[i];
}
if (A[n - 1] >= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 935,821 | 935,820 | u207948013 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l[n];
int t, max = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> t;
sum += t;
if (t > max)
max = t;
}
sum -= max;
if (sum > max)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l[n];
int t, max = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> t;
sum += t;
if (t > max)
max = t;
}
sum -= max;
if (sum > max)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,826 | 935,827 | u264547551 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int max = *max_element(l, l + n);
if (max < accumulate(l, l + n, -max)) {
cout << "Yes;";
} else {
cout << "No";
}
} | #include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
int max = *max_element(l, l + n);
if (max < accumulate(l, l + n, -max)) {
cout << "Yes";
} else {
cout << "No";
}
} | [
"literal.string.change",
"io.output.change"
] | 935,828 | 935,829 | u397732894 | cpp |
p03136 | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> ss(s);
for (int i = 1; i < s; i++) {
cin >> ss[i];
}
sort(ss.begin(), ss.end(), greater<int>());
int ct = 0;
for (int i = 1; i < s; i++) {
ct += ss[i];
}
if (ct > ss[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int s;
cin >> s;
vector<int> ss(s);
for (int i = 0; i < s; i++) {
cin >> ss[i];
}
sort(ss.begin(), ss.end(), greater<int>());
int ct = 0;
for (int i = 1; i < s; i++) {
ct += ss[i];
}
if (ct > ss[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 935,830 | 935,831 | u904995051 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int arr[10], N, total = 0;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
sort(arr, arr + N);
// strictly less than sum of n-1 ..
accumulate(arr, arr + N - 1, total);
if (total > arr[N - 1]) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int arr[10], N, total = 0;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
sort(arr, arr + N);
// strictly less than sum of n-1 ..
total = accumulate(arr, arr + N - 1, total);
if (total > arr[N - 1]) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
}
| [
"assignment.change"
] | 935,835 | 935,836 | u777477705 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define sc scanf
#define pr printf
#define pb push_back
#define ll long long int
int main() {
ll n, i, s = 0;
vector<long> v;
cin >> n;
while (n--) {
cin >> i;
v.pb(i);
sort(v.begin(), v.end());
}
for (i = 0; i < v.size() - 1; i++) {
s = s + v[i];
}
if (v[v.size() - 1] < s)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define sc scanf
#define pr printf
#define pb push_back
#define ll long long int
int main() {
ll n, i, s = 0;
vector<long> v;
cin >> n;
while (n--) {
cin >> i;
v.pb(i);
sort(v.begin(), v.end());
}
for (i = 0; i < v.size() - 1; i++) {
s = s + v[i];
}
if (v[v.size() - 1] < s)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,845 | 935,846 | u447114246 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++)
L[i];
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L[i];
if (sum > L[N - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L[i];
if (sum > L[N - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operation.binary.add"
] | 935,847 | 935,848 | u105533331 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int n;
cin >> n;
vector<int> l;
rep(i, n) {
int x;
cin >> x;
l.push_back(x);
}
int check = 0;
sort(l.begin(), l.end(), greater<int>());
for (int i = 1; i < l.size(); i++) {
check += l[i];
}
if (l[0] > check) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int n;
cin >> n;
vector<int> l;
rep(i, n) {
int x;
cin >> x;
l.push_back(x);
}
int check = 0;
sort(l.begin(), l.end(), greater<int>());
for (int i = 1; i < l.size(); i++) {
check += l[i];
}
if (l[0] >= check) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,849 | 935,850 | u905170328 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int max;
max = *max_element(vec.begin(), vec.end());
int total = 0;
for (int i = 0; i < N; i++) {
total += vec.at(i);
}
if (max < (total - max)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int max;
max = *max_element(vec.begin(), vec.end());
int total = 0;
for (int i = 0; i < N; i++) {
total += vec.at(i);
}
if (max < (total - max)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [] | 935,851 | 935,852 | u964947409 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
int num = -1e9;
int num2 = 0;
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
for (int i = 0; i < N; ++i) {
num = max(L[i], num);
}
for (int i = 0; i < N; ++i) {
num2 = L[i] + num2;
}
int num3 = num2 - num;
if (num + 1 < num3) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
int num = -1e9;
int num2 = 0;
for (int i = 0; i < N; ++i) {
cin >> L[i];
}
for (int i = 0; i < N; ++i) {
num = max(L[i], num);
}
for (int i = 0; i < N; ++i) {
num2 = L[i] + num2;
}
int num3 = num2 - num;
if (num < num3) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"expression.operation.binary.remove"
] | 935,855 | 935,856 | u091026689 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<int> que;
rep(i, n) {
int tmp;
cin >> tmp;
que.push(tmp);
}
int a, b;
b = 0;
a = que.top();
que.pop();
cout << a;
while (!que.empty()) {
b += que.top();
que.pop();
}
string ans;
if (a < b)
ans = "Yes";
else
ans = "No";
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<int> que;
rep(i, n) {
int tmp;
cin >> tmp;
que.push(tmp);
}
int a, b;
b = 0;
a = que.top();
que.pop();
while (!que.empty()) {
b += que.top();
que.pop();
}
string ans;
if (a < b)
ans = "Yes";
else
ans = "No";
cout << ans << endl;
} | [] | 935,867 | 935,868 | u741134767 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VLL;
int main() {
int n, k = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
sort(l.begin(), l.end());
for (int i = 0; i < n - 1; ++i) {
k += l[i];
}
if (k > l[n])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VLL;
int main() {
int n, k = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; ++i) {
cin >> l[i];
}
sort(l.begin(), l.end());
for (int i = 0; i < n - 1; ++i) {
k += l[i];
}
if (k > l[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 935,869 | 935,870 | u812874294 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define ANS cout << ans << endl
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define REVERSE(a) reverse(all(a))
#define int long long
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define VIin(a) \
for (int i = 0; i < a.size(); i++) \
cin >> a[i]
#define OUT(a) cout << a << endl
typedef vector<int> VI;
typedef vector<VI> VVI;
const int MOD = 1e9 + 7;
const long long INF = 1LL << 60;
/*最大公約数*/ int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ int lcm(int a, int b) {
int g = gcd(a, b);
return a / g * b;
}
/*素数判定*/ int isPrime(int n) {
if (n < 2) {
return 0;
}
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
/*約数列挙*/ vector<int> getDivisor(int n) {
vector<int> v;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
v.push_back(i);
if (i != n / i) {
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
return v;
}
//----------------------------------------------
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
VI l(n);
VIin(l);
SORT(l);
REVERSE(l);
int sum = 0;
rep(i, n - 1) sum += l[i];
if (sum > l[n - 1])
Yes;
else
No;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define ANS cout << ans << endl
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define REVERSE(a) reverse(all(a))
#define int long long
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define VIin(a) \
for (int i = 0; i < a.size(); i++) \
cin >> a[i]
#define OUT(a) cout << a << endl
typedef vector<int> VI;
typedef vector<VI> VVI;
const int MOD = 1e9 + 7;
const long long INF = 1LL << 60;
/*最大公約数*/ int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
/*最小公倍数*/ int lcm(int a, int b) {
int g = gcd(a, b);
return a / g * b;
}
/*素数判定*/ int isPrime(int n) {
if (n < 2) {
return 0;
}
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
/*約数列挙*/ vector<int> getDivisor(int n) {
vector<int> v;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
v.push_back(i);
if (i != n / i) {
v.push_back(n / i);
}
}
}
sort(v.begin(), v.end());
return v;
}
//----------------------------------------------
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
VI l(n);
VIin(l);
SORT(l);
int sum = 0;
rep(i, n - 1) sum += l[i];
if (sum > l[n - 1])
Yes;
else
No;
return 0;
} | [
"call.remove"
] | 935,871 | 935,872 | u969651765 | cpp |
p03136 | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += L.at(i);
}
if (sum < L.at(N - 1)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include "bits/stdc++.h"
#include "math.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += L.at(i);
}
if (sum <= L.at(N - 1)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,883 | 935,884 | u074003648 | cpp |
p03136 | #include "bits/stdc++.h"
#include "math.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += L.at(i);
}
if (sum > L.at(N - 1)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include "bits/stdc++.h"
#include "math.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += L.at(i);
}
if (sum <= L.at(N - 1)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,885 | 935,884 | u074003648 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
int sum = 0;
int max = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
if (max < A[i]) {
max = A[i];
}
}
if (max > sum - max) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N, 0);
int sum = 0;
int max = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
sum += A[i];
if (max < A[i]) {
max = A[i];
}
}
if (max >= sum - max) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | [
"call.arguments.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,887 | 935,888 | u614217744 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, big, flag = 0, sum = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
big = l[0];
for (int i = 0; i < n; i++) {
big = max(big, l[i]);
}
for (int i = 0; i < n; i++) {
if (big == l[i] && flag == 0) {
continue;
flag++;
} else {
sum += l[i];
}
}
if (sum > big) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, big, flag = 0, sum = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
big = l[0];
for (int i = 0; i < n; i++) {
big = max(big, l[i]);
}
for (int i = 0; i < n; i++) {
if (big == l[i] && flag == 0) {
flag++;
continue;
} else {
sum += l[i];
}
}
if (sum > big) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [] | 935,898 | 935,899 | u553461888 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll mod = 1000000007;
void solve() {
int n;
cin >> n;
int l[n + 10];
int sum = 0;
int m = 0;
rep(i, n) {
cin >> l[i];
sum += l[i];
m = max(m, l[i]);
}
if (m < sum - m)
cout << "Yes" << endl;
else
cout << "no" << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
typedef long long unsigned int llu;
ll mod = 1000000007;
void solve() {
int n;
cin >> n;
int l[n + 10];
int sum = 0;
int m = 0;
rep(i, n) {
cin >> l[i];
sum += l[i];
m = max(m, l[i]);
}
if (m < sum - m)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,900 | 935,901 | u272496669 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int max_idx = l[0];
int total = l[0];
for (int i = 1; i < n; i++) {
if (l[i] > l[max_idx])
max_idx = i;
total += l[i];
}
if (l[max_idx] < total - l[max_idx])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
int max_idx = 0;
int total = l[0];
for (int i = 1; i < n; i++) {
if (l[i] > l[max_idx])
max_idx = i;
total += l[i];
}
if (l[max_idx] < total - l[max_idx])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [] | 935,903 | 935,904 | u526630579 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int repeat;
cin >> repeat;
int num;
int total = 0;
int max = 0;
int old = 0;
while (repeat--) {
cin >> num;
old = max;
if (num >= max) {
max = num;
}
if (old != max) {
total += old;
} else {
total += num;
}
}
if (max <= total) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int repeat;
cin >> repeat;
int num;
int total = 0;
int max = 0;
int old = 0;
while (repeat--) {
cin >> num;
old = max;
if (num >= max) {
max = num;
}
if (old != max) {
total += old;
} else {
total += num;
}
}
if (max < total) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,905 | 935,906 | u840731541 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int repeat;
cin >> repeat;
int num;
int total = 0;
int max = 0;
int old = 0;
while (repeat--) {
cin >> num;
old = max;
if (num >= max) {
max = num;
}
if (old != max) {
total += old;
} else {
total += num;
}
}
if (max <= total) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int repeat;
cin >> repeat;
int num;
int total = 0;
int max = 0;
int old = 0;
while (repeat--) {
cin >> num;
old = max;
if (num >= max) {
max = num;
}
if (old != max) {
total += old;
} else {
total += num;
}
}
if (max < total) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 935,907 | 935,906 | u840731541 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int repeat;
cin >> repeat;
int num;
int total = 0;
int max = 0;
int old = 0;
while (repeat--) {
cin >> num;
old = max;
if (num >= max) {
max = num;
}
if (old != max) {
total += old;
} else {
total += num;
}
}
if (max <= total) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int repeat;
cin >> repeat;
int num;
int total = 0;
int max = 0;
int old = 0;
while (repeat--) {
cin >> num;
old = max;
if (num >= max) {
max = num;
}
if (old != max) {
total += old;
} else {
total += num;
}
}
if (max < total) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,905 | 935,908 | u840731541 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int repeat;
cin >> repeat;
int num;
int total = 0;
int max = 0;
int old = 0;
while (repeat--) {
cin >> num;
old = max;
if (num >= max) {
max = num;
}
if (old != max) {
total += old;
} else {
total += num;
}
}
if (max <= total) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int repeat;
cin >> repeat;
int num;
int total = 0;
int max = 0;
int old = 0;
while (repeat--) {
cin >> num;
old = max;
if (num >= max) {
max = num;
}
if (old != max) {
total += old;
} else {
total += num;
}
}
if (max < total) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 935,907 | 935,908 | u840731541 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n, M = 0, sum = 0, l;
cin >> l;
for (int i = 0; i < n; i++) {
cin >> l;
sum += l;
M = max(M, l);
}
if (sum > 2 * M)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, M = 0, sum = 0, l;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l;
sum += l;
M = max(M, l);
}
if (sum > 2 * M)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"identifier.change",
"expression.operation.binary.change"
] | 935,912 | 935,913 | u110383054 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#define REPIT_R(it, container) \
for (auto it = container.rbegin(); it != container.rend(); it++)
// input
#define cin1(x) cin >> x
#define cin2(x, y) cin >> x >> y
#define cin3(x, y, z) cin >> x >> y >> z
#define ncin1(n, x) \
REP(i, 0, n) { cin1(x[i]); }
#define ncin2(n, x, y) \
REP(i, 0, n) { cin2(x[i], y[i]); }
#define ncin3(n, x, y, z) \
REP(i, 0, n) { cin3(x[i], y[i], z[i]); }
// output
#define cout1(x) cout << #x << ": " << x << endl;
#define cout2(x, y) cout << #x << ": " << x << ", " << #y << ": " << y << endl;
#define cout3(x, y, z) \
cout << #x << ": " << x << ", " << #y << ": " << y << ", " << #z << ": " \
<< z << endl; \
;
#define ncout1(n, x) \
REP(i, 0, n) { cout << #x << "[" << i << "]: " << x[i] << endl; }
#define coutp(p) \
cout << #p << ":" \
<< " (" << p.first << ", " << p.second << ")" << endl;
// sort
#define sort_r(x, y) sort(x, y, greater<lli>()); // 降順(5,4,3,,,)
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
typedef long long int lli;
typedef pair<lli, lli> P;
typedef tuple<lli, lli, lli> tup;
int main() {
lli n;
cin1(n);
lli l[n];
ncin1(n, l);
lli max_n = 0;
lli ans = 0;
REP(i, 0, n) {
max_n = max(max_n, l[i]);
ans += l[i];
}
ans -= max_n;
if (ans >= max_n)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#define REPIT_R(it, container) \
for (auto it = container.rbegin(); it != container.rend(); it++)
// input
#define cin1(x) cin >> x
#define cin2(x, y) cin >> x >> y
#define cin3(x, y, z) cin >> x >> y >> z
#define ncin1(n, x) \
REP(i, 0, n) { cin1(x[i]); }
#define ncin2(n, x, y) \
REP(i, 0, n) { cin2(x[i], y[i]); }
#define ncin3(n, x, y, z) \
REP(i, 0, n) { cin3(x[i], y[i], z[i]); }
// output
#define cout1(x) cout << #x << ": " << x << endl;
#define cout2(x, y) cout << #x << ": " << x << ", " << #y << ": " << y << endl;
#define cout3(x, y, z) \
cout << #x << ": " << x << ", " << #y << ": " << y << ", " << #z << ": " \
<< z << endl; \
;
#define ncout1(n, x) \
REP(i, 0, n) { cout << #x << "[" << i << "]: " << x[i] << endl; }
#define coutp(p) \
cout << #p << ":" \
<< " (" << p.first << ", " << p.second << ")" << endl;
// sort
#define sort_r(x, y) sort(x, y, greater<lli>()); // 降順(5,4,3,,,)
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
typedef long long int lli;
typedef pair<lli, lli> P;
typedef tuple<lli, lli, lli> tup;
int main() {
lli n;
cin1(n);
lli l[n];
ncin1(n, l);
lli max_n = 0;
lli ans = 0;
REP(i, 0, n) {
max_n = max(max_n, l[i]);
ans += l[i];
}
ans -= max_n;
if (ans > max_n)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,914 | 935,915 | u058297300 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int max = 0;
int sum = 0;
for (int i = 0; i < n; ++i) {
int l;
cin >> l;
if (max < l) {
max = l;
}
sum += l;
}
if (sum - max < max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int max = 0;
int sum = 0;
for (int i = 0; i < n; ++i) {
int l;
cin >> l;
if (max < l) {
max = l;
}
sum += l;
}
if (sum - max > max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,921 | 935,922 | u611571299 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ma = -1, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
ma = max(ma, x);
sum += (x);
}
if (sum - ma > x)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, ma = -1, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
ma = max(ma, x);
sum += (x);
}
if (sum - ma > ma)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 935,923 | 935,924 | u708590262 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int line[N];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> line[i];
sum += line[i];
}
int hantei = 0;
for (int i = 0; i < N; i++) {
if (sum - line[i] < line[i]) {
hantei++;
}
}
if (hantei == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int line[N];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> line[i];
sum += line[i];
}
int hantei = 0;
for (int i = 0; i < N; i++) {
if (sum - line[i] <= line[i]) {
hantei++;
}
}
if (hantei == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 935,928 | 935,929 | u629044751 | cpp |
p03136 | #include <iostream>
#include <string>
using namespace std;
int main() {
int i, n, m = 0, a, b = 0;
cin >> n;
int l[n];
for (i = 0; i < n; i++) {
cin >> l[i];
}
for (i = 0; i < n; i++) {
if (l[i] > m) {
m = l[i];
}
}
for (i = 0; i < n; i++) {
if (l[i] == m) {
a = i;
break;
}
}
for (i = a + 1; i < n; i++) {
b = b + l[i];
}
for (i = a - 1; i >= 0; i--) {
b = b + l[i];
}
if (m < b) {
cout << "YES";
} else {
cout << "NO";
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int i, n, m = 0, a, b = 0;
cin >> n;
int l[n];
for (i = 0; i < n; i++) {
cin >> l[i];
}
for (i = 0; i < n; i++) {
if (l[i] > m) {
m = l[i];
}
}
for (i = 0; i < n; i++) {
if (l[i] == m) {
a = i;
break;
}
}
for (i = a + 1; i < n; i++) {
b = b + l[i];
}
for (i = a - 1; i >= 0; i--) {
b = b + l[i];
}
if (m < b) {
cout << "Yes";
} else {
cout << "No";
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,930 | 935,931 | u834488582 | cpp |
p03136 | #include <algorithm>
#include <iostream> //第1题
#include <string>
using namespace std;
int main() {
int n = 0, A[100] = {0}, a = 0, b = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
a = max(A[i], a);
}
for (int i = 0; i < n; i++) {
b = A[i] + b;
}
b = b - a;
if (b > a) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #include <algorithm>
#include <iostream> //第1题
#include <string>
using namespace std;
int main() {
int n = 0, A[100] = {0}, a = 0, b = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
for (int i = 0; i < n; i++) {
a = max(A[i], a);
}
for (int i = 0; i < n; i++) {
b = A[i] + b;
}
b = b - a;
if (b > a) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 935,932 | 935,933 | u834488582 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int l[n];
int sum = 0;
int max = 0;
for (int i = 0; i < n; i++)
cin >> l[i];
for (int j = 0; j < n; j++) {
sum += l[j];
if (l[j] > max)
max = l[j];
}
if (max < (sum - max))
cout << 'Yes' << endl;
else
cout << 'No' << endl;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int l[n];
int sum = 0;
int max = 0;
for (int i = 0; i < n; i++)
cin >> l[i];
for (int j = 0; j < n; j++) {
sum += l[j];
if (l[j] > max)
max = l[j];
}
if (max < (sum - max))
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.string.change",
"io.output.change"
] | 935,936 | 935,937 | u405039712 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.