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 <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string ans;
int n;
int max = 0;
int sum = 0;
cin >> n;
vector<int> L(n);
for (int i = 0; i < n; i++) {
cin >> L[i];
}
for (int i = 0; i < n; i++) {
sum += L[i];
if (max < L[i]) {
max = L[i];
}
}
if (sum - max > max) {
ans = "YES";
} else {
ans = "NO";
}
cout << ans;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string ans;
int n;
int max = 0;
int sum = 0;
cin >> n;
vector<int> L(n);
for (int i = 0; i < n; i++) {
cin >> L[i];
}
for (int i = 0; i < n; i++) {
sum += L[i];
if (max < L[i]) {
max = L[i];
}
}
if (sum - max > max) {
ans = "Yes";
} else {
ans = "No";
}
cout << ans;
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 936,434 | 936,435 | u565145466 | cpp |
p03136 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, sum, max = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
sum += L[i];
if (max <= L[i])
max = L[i];
}
if (max < sum - max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int N, sum = 0, max = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
sum += L[i];
if (max <= L[i])
max = L[i];
}
if (max < sum - max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"variable_declaration.value.change"
] | 936,438 | 936,439 | u297292406 | cpp |
p03136 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, sum, max = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
sum += L[i];
if (max < L[i])
max = L[i];
}
if (max < sum - max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int N, sum = 0, max = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
sum += L[i];
if (max <= L[i])
max = L[i];
}
if (max < sum - max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,440 | 936,439 | u297292406 | cpp |
p03136 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, sum, max;
cin >> N;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
sum += L[i];
if (max < L[i])
max = L[i];
}
if (max < sum - max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
int main() {
int N, sum = 0, max = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
for (int i = 0; i < N; i++) {
sum += L[i];
if (max <= L[i])
max = L[i];
}
if (max < sum - max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,441 | 936,439 | u297292406 | 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[i];
sort(a.begin(), a.end());
if (a[n] < accumulate(a.begin(), a.end() - 1, 0))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #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[i];
sort(a.begin(), a.end());
if (a[n - 1] < accumulate(a.begin(), a.end() - 1, 0))
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 936,454 | 936,455 | u167604613 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0, ma = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
ma = max(ma, L);
sum += L;
}
if (ma < sum - ma) {
cout << "Yes" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0, ma = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
ma = max(ma, L);
sum += L;
}
if (ma < sum - ma) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,458 | 936,459 | u832995587 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0, ma = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
ma = max(ma, L);
sum += L;
}
if (ma < (sum - ma)) {
cout << "Yes" << endl;
} else {
cout << "NO" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0, ma = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
ma = max(ma, L);
sum += L;
}
if (ma < sum - ma) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,460 | 936,459 | u832995587 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
std::vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int max = *max_element(L.begin(), L.end());
int sum = accumulate(L.begin(), L.end(), 0) - max;
if (max > sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N = 0;
cin >> N;
std::vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L[i];
int max = *max_element(L.begin(), L.end());
int sum = accumulate(L.begin(), L.end(), 0) - max;
if (max < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,461 | 936,462 | u224992778 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int maxof(const int a[], int n) {
int i;
int max = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max)
max = a[i];
}
return max;
}
int main() {
int N;
cin >> N;
int L[N];
for (int i = 0; i <= N - 1; i = i + 1) {
cin >> L[i];
}
int nx = sizeof(L) / sizeof(L[0]);
int max = maxof(L, nx);
int sum = 0;
for (int i = 0; i < N; i = i + 1) {
sum += L[i];
}
int d_sum = sum - max;
if (max > d_sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int maxof(const int a[], int n) {
int i;
int max = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max)
max = a[i];
}
return max;
}
int main() {
int N;
cin >> N;
int L[N];
for (int i = 0; i <= N - 1; i = i + 1) {
cin >> L[i];
}
int nx = sizeof(L) / sizeof(L[0]);
int max = maxof(L, nx);
int sum = 0;
for (int i = 0; i < N; i = i + 1) {
sum += L[i];
}
int d_sum = sum - max;
if (max >= d_sum) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 936,463 | 936,464 | u403832169 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
int LMAX;
int S = 0;
for (int i = 0; i < N; i++) {
cin >> L.at(i);
if (L.at(i) > LMAX) {
LMAX = L.at(i);
}
S = S + L.at(i);
}
if (S - LMAX > LMAX) {
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 LMAX = 0;
int S = 0;
for (int i = 0; i < N; i++) {
cin >> L.at(i);
if (L.at(i) > LMAX) {
LMAX = L.at(i);
}
S = S + L.at(i);
}
if (S - LMAX > LMAX) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"variable_declaration.value.change"
] | 936,467 | 936,468 | u789417760 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a;
b = 0;
c = 0;
d = 0;
e = 0;
while (a >= b) {
b = b + 1;
cin >> c;
if (c > d) {
d = c;
}
e = e + c;
}
e = e - d;
if (d > e) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a;
b = 0;
c = 0;
d = 0;
e = 0;
while (a > b) {
b = b + 1;
cin >> c;
if (c > d) {
d = c;
}
e = e + c;
}
e = e - d;
if (d < e) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 936,471 | 936,470 | u783598783 | 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);
}
int Lmax = 0, S = 0;
for (int i = 0; i < N; i++) {
if (L.at(i) > Lmax) {
Lmax = L.at(i);
}
S = S + L.at(i);
}
if (S - Lmax < Lmax) {
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);
}
int Lmax = 0, S = 0;
for (int i = 0; i < N; i++) {
if (L.at(i) > Lmax) {
Lmax = L.at(i);
}
S = S + L.at(i);
}
if (S - Lmax > Lmax) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,472 | 936,473 | u795273869 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, a;
vector<int> L;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
L.push_back(a);
}
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += L[i];
}
if (L[N] > sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, a;
vector<int> L;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
L.push_back(a);
}
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;
} | [
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 936,479 | 936,480 | u797165415 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, int B) { return (A + (B - 1)) / B; }
long long divCeil(int A, long long B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, long long B) { return (A + (B - 1)) / B; }
int main() {
int N;
cin >> N;
int sum = 0;
int max = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
if (!chmax(max, L))
sum += L;
}
string ans = "No";
if (max < sum)
ans = "Yes";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = pow(10, 9) + 7;
const long long INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int divCeil(int A, int B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, int B) { return (A + (B - 1)) / B; }
long long divCeil(int A, long long B) { return (A + (B - 1)) / B; }
long long divCeil(long long A, long long B) { return (A + (B - 1)) / B; }
int main() {
int N;
cin >> N;
int sum = 0;
int max = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
chmax(max, L);
sum += L;
}
string ans = "No";
if (max < sum - max)
ans = "Yes";
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change"
] | 936,483 | 936,484 | u811472478 | cpp |
p03136 | #include <cstdlib>
#include <iostream>
int main() {
int N;
std::cin >> N;
int arr[10];
int total = 0;
for (int i = 0; i < N; i++) {
std::cin >> arr[i];
total += arr[i];
}
bool correct = true;
for (int i = 0; i < N && correct; i++) {
if (arr[i] > total - arr[i])
correct = false;
}
if (correct)
std::cout << "Yes";
else
std::cout << "No";
} | #include <cstdlib>
#include <iostream>
int main() {
int N;
std::cin >> N;
int arr[10];
int total = 0;
for (int i = 0; i < N; i++) {
std::cin >> arr[i];
total += arr[i];
}
bool correct = true;
for (int i = 0; i < N && correct; i++) {
if (arr[i] >= total - arr[i])
correct = false;
}
if (correct)
std::cout << "Yes";
else
std::cout << "No";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,485 | 936,486 | u853418194 | cpp |
p03136 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N;
cin >> N;
std::vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
sort(v.begin(), v.end());
int a = 0;
for (int i = 0; i < N - 1; i++)
a += v[i];
if (a < v[N - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N;
cin >> N;
std::vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
sort(v.begin(), v.end());
int a = 0;
for (int i = 0; i < N - 1; i++)
a += v[i];
if (a > v[N - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,493 | 936,494 | u942774736 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> l(N, 0);
for (int i = 0; i < N; i++) {
cin >> l.at(i);
}
sort(l.begin(), l.end());
int sum;
for (int i = 0; i < N - 1; i++) {
sum += l.at(i);
}
int mxl = l.at(N - 1);
if (mxl < 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, 0);
for (int i = 0; i < N; i++) {
cin >> l.at(i);
}
sort(l.begin(), l.end());
/*
for(int i=0;i<N;i++){
cout << l.at(i);
}*/
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += l.at(i);
}
int mxl = l.at(N - 1);
if (mxl < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"variable_declaration.value.change"
] | 936,504 | 936,505 | u351208563 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> edge(N);
for (int i = 0; i < N; i++) {
cin >> edge.at(i);
}
sort(edge.rbegin(), edge.rend());
int sum = 0;
for (int i = 1; i < N + 1; i++) {
sum += edge.at(i);
}
if (sum < edge.at(0))
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> edge(N);
for (int i = 0; i < N; i++) {
cin >> edge.at(i);
}
sort(edge.rbegin(), edge.rend());
int sum = 0;
for (int i = 1; i < N; i++) {
sum += edge.at(i);
}
// cout<<edge.at(0)<<sum<<endl;
if (sum <= edge.at(0))
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,518 | 936,519 | u223504018 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> edge(N);
for (int i = 0; i < N; i++) {
cin >> edge.at(i);
}
sort(edge.rbegin(), edge.rend());
int sum = 0;
for (int i = 1; i < N; i++) {
sum += edge.at(i);
}
if (sum < edge.at(0))
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> edge(N);
for (int i = 0; i < N; i++) {
cin >> edge.at(i);
}
sort(edge.rbegin(), edge.rend());
int sum = 0;
for (int i = 1; i < N; i++) {
sum += edge.at(i);
}
// cout<<edge.at(0)<<sum<<endl;
if (sum <= edge.at(0))
cout << "No" << endl;
else
cout << "Yes" << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,520 | 936,519 | u223504018 | cpp |
p03136 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> L(N);
REP(i, N) 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] < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> L(N);
REP(i, N) 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;
} | [
"control_flow.branch.if.condition.change"
] | 936,525 | 936,526 | u520129469 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, L[1000] = {0}, sum = 0, MAX = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> L[i];
MAX = max(L[i], MAX);
sum = sum + L[i];
}
if (MAX < (sum - MAX))
cout << "YES";
else
cout << "No";
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, L[1000] = {0}, sum = 0, MAX = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> L[i];
MAX = max(L[i], MAX);
sum = sum + L[i];
}
if (MAX < (sum - MAX))
cout << "Yes";
else
cout << "No";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,538 | 936,539 | u466318894 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[100], n, i, s, j;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
s = 0;
for (j = 0; j < n; j++) {
if (i == j) {
} else {
s = s + a[j];
}
}
if (a[i] > s) {
cout << "No";
return 0;
}
}
cout << "Yes";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a[100], n, i, s, j;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
s = 0;
for (j = 0; j < n; j++) {
if (i == j) {
} else {
s = s + a[j];
}
}
if (a[i] >= s) {
cout << "No";
return 0;
}
}
cout << "Yes";
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,547 | 936,548 | u121761871 | cpp |
p03136 | #include <stdio.h>
#include <stdlib.h>
void Quicksort_rand(int A[], int L, int R);
int main(void) {
int N, L[105], i, sum = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
Quicksort_rand(L, 0, N - 1);
for (i = 0; i < N - 1; i++) {
sum += L[i];
}
if (L[N - 1] < sum) {
printf("yes");
} else
printf("no");
return 0;
}
void Quicksort_rand(int A[], int L, int R) /*A[L]~A[R]までソート*/
{
if (L < R) {
int r, tmp, p = L, k = L + 1;
srand(0);
r = rand() % (R - L + 1) + L; // pivotを選択
// pivotを先頭に置く
tmp = A[L];
A[L] = A[r];
A[r] = tmp;
//左の翼と右の翼に分ける
while (k <= R) {
if (A[k] < A[L]) {
tmp = A[k];
A[k] = A[p + 1];
A[p + 1] = tmp;
p++;
}
k++;
}
// pivotを左右の翼の境目に置く
tmp = A[L];
A[L] = A[p];
A[p] = tmp;
//左右の翼で再帰
Quicksort_rand(A, L, p - 1);
Quicksort_rand(A, p + 1, R);
}
return;
} | #include <stdio.h>
#include <stdlib.h>
void Quicksort_rand(int A[], int L, int R);
int main(void) {
int N, L[105], i, sum = 0;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &L[i]);
}
Quicksort_rand(L, 0, N - 1);
for (i = 0; i < N - 1; i++) {
sum += L[i];
}
if (L[N - 1] < sum) {
printf("Yes");
} else
printf("No");
return 0;
}
void Quicksort_rand(int A[], int L, int R) /*A[L]~A[R]までソート*/
{
if (L < R) {
int r, tmp, p = L, k = L + 1;
srand(0);
r = rand() % (R - L + 1) + L; // pivotを選択
// pivotを先頭に置く
tmp = A[L];
A[L] = A[r];
A[r] = tmp;
//左の翼と右の翼に分ける
while (k <= R) {
if (A[k] < A[L]) {
tmp = A[k];
A[k] = A[p + 1];
A[p + 1] = tmp;
p++;
}
k++;
}
// pivotを左右の翼の境目に置く
tmp = A[L];
A[L] = A[p];
A[p] = tmp;
//左右の翼で再帰
Quicksort_rand(A, L, p - 1);
Quicksort_rand(A, p + 1, R);
}
return;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 936,551 | 936,552 | u924527074 | cpp |
p03136 | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int s = 0, max = 0, x;
while (n--) {
cin >> x;
s += x;
if (x > max)
max = x;
}
if (s - max > max)
cout << "YES";
else
cout << "NO";
return 0;
} | #include <iomanip>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int s = 0, max = 0, x;
while (n--) {
cin >> x;
s += x;
if (x > max)
max = x;
}
if (s - max > max)
cout << "Yes";
else
cout << "No";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,553 | 936,554 | u193815565 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
for (int i = 0; i < N; ++i)
cin >> L[i];
sort(L, L + N, greater<int>());
int L_max = L[0];
int L_sum = 0;
for (int j = 1; j <= N; j++) {
L_sum += L[j];
}
if (L_max < L_sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int L[100];
for (int i = 0; i < N; ++i)
cin >> L[i];
sort(L, L + N, greater<int>());
int L_max = L[0];
int L_sum = 0;
for (int j = 1; j < N; j++) {
L_sum += L[j];
}
if (L_max < L_sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 936,565 | 936,566 | u809700806 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
// ここにプログラム
int n, a;
int sum = 0;
int m = 1000;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
m = max(m, a);
}
if (m < sum - m) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
// ここにプログラム
int n, a;
int sum = 0;
int m = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
m = max(m, a);
}
if (m < sum - m) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 936,571 | 936,572 | u386907894 | cpp |
p03136 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define NMAX 110000
typedef long long ll;
int main() {
int n;
vector<int> l;
cin >> n;
l.resize(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])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define NMAX 110000
typedef long long ll;
int main() {
int n;
vector<int> l;
cin >> n;
l.resize(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;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 936,573 | 936,574 | u416434647 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int max = 0;
int c, t;
t = 0;
cin >> c;
for (int i = 0; i < c; i++) {
int x;
cin >> x;
t += x;
if (x > max) {
max = x;
t -= max;
}
}
if (max < t)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int max = 0;
int c, t;
t = 0;
cin >> c;
for (int i = 0; i < c; i++) {
int x;
cin >> x;
t += x;
if (x > max) {
max = x;
}
}
t -= max;
if (max < t)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [] | 936,577 | 936,578 | u575708491 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
int L[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> L[i];
}
sort(L, L + n);
int max = L[n - 1];
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += L[i];
}
if (max < sum) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n;
int L[100];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> L[i];
}
sort(L, L + n);
int max = L[n - 1];
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += L[i];
}
if (max < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,585 | 936,586 | u871841829 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> length(N);
for (int i = 0; i < N; i++) {
cin >> length.at(i);
}
sort(length.begin(), length.end());
for (int i = 0; i < N - 2; i++) {
sum += length.at(i);
}
if (sum <= length.at(N - 1)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> length(N);
for (int i = 0; i < N; i++) {
cin >> length.at(i);
}
sort(length.begin(), length.end());
for (int i = 0; i < N - 1; i++) {
sum += length.at(i);
}
if (sum <= length.at(N - 1)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 936,587 | 936,588 | u934064105 | cpp |
p03136 | #include <algorithm>
#include <iostream>
int main() {
int N, L[100], sum = 0;
std::cin >> N;
for (int i = 0; i < N; i++)
std::cin >> L[i];
std::sort(L, L + N);
for (int i = 0; i < N - 1; i++) {
sum += L[i];
}
if (sum > L[N - 1])
std::cout << "Yes";
else
std::cout << "NO";
return 0;
}
| #include <algorithm>
#include <iostream>
int main() {
int N, L[100], sum = 0;
std::cin >> N;
for (int i = 0; i < N; i++)
std::cin >> L[i];
std::sort(L, L + N);
for (int i = 0; i < N - 1; i++) {
sum += L[i];
}
if (sum > L[N - 1])
std::cout << "Yes";
else
std::cout << "No";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 936,593 | 936,594 | u451529323 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
int sum = 0;
for (int i = 0; i < n; i++) {
sum += v[i];
}
if (sum > v[n - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += v[i];
}
if (sum > v[n - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 936,595 | 936,596 | u681557252 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
int side[n + 5], sum = 0;
for (int i = 0; i < n; ++i) {
cin >> side[i];
sum += side[i];
}
for (int i = 0; i < n; ++i)
if (side[i] > sum - side[i]) {
cout << "No\n";
return 0;
}
cout << "Yes\n";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
int side[n + 5], sum = 0;
for (int i = 0; i < n; ++i) {
cin >> side[i];
sum += side[i];
}
for (int i = 0; i < n; ++i)
if (side[i] >= sum - side[i]) {
cout << "No\n";
return 0;
}
cout << "Yes\n";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,597 | 936,598 | u516708338 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll maxi = 0;
ll maxisum = 0;
for (int z = 0; z < n; z++) {
ll temp;
cin >> temp;
maxisum += temp;
maxi = max(maxi, temp);
}
if (maxi < maxisum - maxi)
cout << "YES" << endl;
else
cout << "NO" << endl;
cin >> n;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n;
cin >> n;
ll maxi = 0;
ll sum = 0;
for (int z = 0; z < n; z++) {
ll temp;
cin >> temp;
sum += temp;
maxi = max(maxi, temp);
}
if (maxi < sum - maxi)
cout << "Yes" << endl;
else
cout << "No" << endl;
cin >> n;
}
| [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,615 | 936,616 | u553927381 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<int> l;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
l.push_back(a);
}
sort(l.begin(), l.end());
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += l[i];
}
if (sum <= l[n]) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<int> l;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
l.push_back(a);
}
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 << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 936,619 | 936,620 | u175948183 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<int> l;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
l.push_back(a);
}
sort(l.begin(), l.end());
int sum = 0;
for (int i = 0; i < n ^ 1; i++) {
sum += l[i];
}
if (sum <= l[n]) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int n;
vector<int> l;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
l.push_back(a);
}
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 << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 936,621 | 936,620 | u175948183 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
std::sort(v.begin(), v.end());
int max = *std::max_element(v.begin(), v.end());
v.erase(std::max_element(v.begin(), v.end()));
int sum = std::accumulate(v.begin(), v.end(), 0);
if (sum > max) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
std::sort(v.begin(), v.end());
int max = *std::max_element(v.begin(), v.end());
v.erase(std::max_element(v.begin(), v.end()));
int sum = std::accumulate(v.begin(), v.end(), 0);
if (sum > max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,622 | 936,623 | u097443428 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x, max = 0, t = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
t += x;
if (max < x) {
max = x;
}
}
if (t < 2 * max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x, max = 0, t = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
t += x;
if (max < x) {
max = x;
}
}
if (t > 2 * max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,624 | 936,625 | u977360761 | cpp |
p03136 | #include <iostream>
#include <string>
using namespace std;
int main() {
int X, T, total, i;
T = 0;
cin >> X;
int array[X] = {};
for (i = 0; i < X; i++) {
cin >> array[i];
if (array[i] > T) {
T = array[i];
}
total += array[i];
}
if (total - T > T) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int X, T, total, i;
T = 0;
total = 0;
cin >> X;
int array[X] = {};
for (i = 0; i < X; i++) {
cin >> array[i];
if (array[i] > T) {
T = array[i];
}
total += array[i];
}
if (total - T > T) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"assignment.add"
] | 936,639 | 936,640 | u609576113 | cpp |
p03136 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
}
int max = 0;
for (int i = 0; i < N; i++) {
if (max < L[i]) {
max = L[i];
}
}
if (max - (sum - max)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int L[N];
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
}
int max = 0;
for (int i = 0; i < N; i++) {
if (max < L[i]) {
max = L[i];
}
}
if (max < (sum - max)) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"control_flow.branch.if.condition.change"
] | 936,641 | 936,642 | u123724799 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int a[11];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> 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" << '\n';
} else {
cout << "No" << '\n';
}
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int a[11];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> 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" << '\n';
} else {
cout << "No" << '\n';
}
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,645 | 936,646 | u064087840 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main(void) {
int n, a;
int sum = 0, max = 0;
cin >> n;
rep(i, n) {
cin >> a;
max = std::max(a, max);
sum += a;
}
if ((sum - max) >= max) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main(void) {
int n, a;
int sum = 0, max = 0;
cin >> n;
rep(i, n) {
cin >> a;
max = std::max(a, max);
sum += a;
}
if ((sum - max) <= max) {
cout << "No" << endl;
return 0;
}
cout << "Yes" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,655 | 936,656 | u276268533 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast() ios_base::sync_with_stdio(0), cin.tie(0)
int32_t main() {
int n, i, s;
cin >> n;
vector<int> v(n);
for (i = 0; i < n; ++i)
cin >> v[i];
sort(v.begin(), v.end());
s = accumulate(v.begin(), v.end(), -v[n - 1]);
if (s <= v[n - 1])
cout << "NO";
else
cout << "YES";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fast() ios_base::sync_with_stdio(0), cin.tie(0)
int32_t main() {
int n, i, s;
cin >> n;
vector<int> v(n);
for (i = 0; i < n; ++i)
cin >> v[i];
sort(v.begin(), v.end());
s = accumulate(v.begin(), v.end(), -v[n - 1]);
if (s > v[n - 1])
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 936,657 | 936,658 | u579670739 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int m = 0;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
sum += t;
m = max(m, t);
}
sum -= m;
if (m > sum) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int m = 0;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
sum += t;
m = max(m, t);
}
sum -= m;
if (m >= sum) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,659 | 936,660 | u865604924 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int L[109];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(begin(L), begin(L) + N);
for (int i = 0; i < N - 1; i++) {
L[N - 1] -= L[i];
}
if (L[N - 1] > 0) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int L[109];
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(begin(L), begin(L) + N);
for (int i = 0; i < N - 1; i++) {
L[N - 1] -= L[i];
}
if (L[N - 1] < 0) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,661 | 936,662 | u940755317 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef gp_hash_table<long long, long long> umap;
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define fillinf(ar, n) fr(i, 0, (n)) ar[i] = INF
#define debug(x) cout << #x << ": " << x << endl
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
/*Author Ritick Goenka || ritick(codechef) ||ritick(codeforces) */
/*IIT Roorkee = <3 */
#define ull unsigned long long
#define ll long long
#define ld double
#define ui unsigned int
#define all(ar) ar.begin(), ar.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define y0 yyyyyy0
#define y1 yyyyyy1
#define sot(bello) bello.begin(), bello.end()
#define BIT(n) (1 << (n))
#define SQR(x) ((x) * (x))
#define CUBE(x) ((x) * (x) * (x))
#define LSOne(S) (S) & (-S)
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<string> vs;
template <typename T> inline T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <typename T> inline T lcm(T a, T b) { return (a * b) / gcd(a, b); }
template <typename T> string toStr(T x) {
stringstream st;
st << x;
string s;
st >> s;
return s;
}
template <class T> void splitStr(const string &s, vector<T> &out) {
istringstream in(s);
out.clear();
copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}
inline int two(int n) { return 1 << n; }
inline int isOnBit(int n, int b) { return (n >> b) & 1; }
inline void onBit(int &n, int b) { n |= two(b); }
inline void offBit(int &n, int b) { n &= ~two(b); }
inline int lastBit(int n) { return n & (-n); }
inline int cntBit(int n) {
int res = 0;
while (n && ++res)
n -= n & (-n);
return res;
}
const int dx4[] = {-1, 0, 1, 0};
const int dy4[] = {0, 1, 0, -1};
const int dx8[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy8[] = {0, 1, 0, -1, -1, 1, -1, 1};
#define INP "test.inp"
#define OUT "test.out"
#define PI 3.1415926535897932385
#define INF 1000000000000000
#define EPS 1e-7
#define MAXN 100000
#define MOD 998244353
#define dec decr
// END OF COMPETITVE PROGRAMMING TEMPLATE
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll modexp(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << setprecision(11);
// cout<<fixed;
ll n;
cin >> n;
ll sum = 0;
ll ar[n];
rep(i, n) {
cin >> ar[i];
sum += ar[i];
}
rep(i, n) {
if (sum - ar[i] <= ar[i]) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef gp_hash_table<long long, long long> umap;
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (long long i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define fill0(ar) fill((ar), 0)
#define fillinf(ar, n) fr(i, 0, (n)) ar[i] = INF
#define debug(x) cout << #x << ": " << x << endl
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
/*Author Ritick Goenka || ritick(codechef) ||ritick(codeforces) */
/*IIT Roorkee = <3 */
#define ull unsigned long long
#define ll long long
#define ld double
#define ui unsigned int
#define all(ar) ar.begin(), ar.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define y0 yyyyyy0
#define y1 yyyyyy1
#define sot(bello) bello.begin(), bello.end()
#define BIT(n) (1 << (n))
#define SQR(x) ((x) * (x))
#define CUBE(x) ((x) * (x) * (x))
#define LSOne(S) (S) & (-S)
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<string> vs;
template <typename T> inline T gcd(T a, T b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
template <typename T> inline T lcm(T a, T b) { return (a * b) / gcd(a, b); }
template <typename T> string toStr(T x) {
stringstream st;
st << x;
string s;
st >> s;
return s;
}
template <class T> void splitStr(const string &s, vector<T> &out) {
istringstream in(s);
out.clear();
copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}
inline int two(int n) { return 1 << n; }
inline int isOnBit(int n, int b) { return (n >> b) & 1; }
inline void onBit(int &n, int b) { n |= two(b); }
inline void offBit(int &n, int b) { n &= ~two(b); }
inline int lastBit(int n) { return n & (-n); }
inline int cntBit(int n) {
int res = 0;
while (n && ++res)
n -= n & (-n);
return res;
}
const int dx4[] = {-1, 0, 1, 0};
const int dy4[] = {0, 1, 0, -1};
const int dx8[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy8[] = {0, 1, 0, -1, -1, 1, -1, 1};
#define INP "test.inp"
#define OUT "test.out"
#define PI 3.1415926535897932385
#define INF 1000000000000000
#define EPS 1e-7
#define MAXN 100000
#define MOD 998244353
#define dec decr
// END OF COMPETITVE PROGRAMMING TEMPLATE
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll modexp(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << setprecision(11);
// cout<<fixed;
ll n;
cin >> n;
ll sum = 0;
ll ar[n];
rep(i, n) {
cin >> ar[i];
sum += ar[i];
}
rep(i, n) {
if (sum - ar[i] <= ar[i]) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,671 | 936,672 | u795058347 | cpp |
p03136 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(str) printf(#str "\n")
#define yOUT PRINT(Yes)
#define nOUT PRINT(No)
#define YOUT PRINT(YES)
#define NOUT PRINT(NO)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
int main() {
int n, MAX = 0, sum = 0, inp;
REP(i, n) {
cin >> inp;
sum += inp;
MAX = max(MAX, inp);
}
if (MAX < sum - MAX)
yOUT;
else
nOUT;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define PRINT(str) printf(#str "\n")
#define yOUT PRINT(Yes)
#define nOUT PRINT(No)
#define YOUT PRINT(YES)
#define NOUT PRINT(NO)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
int main() {
int n, MAX = 0, sum = 0, inp;
cin >> n;
REP(i, n) {
cin >> inp;
sum += inp;
MAX = max(MAX, inp);
}
if (MAX < sum - MAX)
yOUT;
else
nOUT;
}
| [] | 936,680 | 936,681 | u833064541 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int *L = new int[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int max = 0;
int sum = 0;
int a;
for (int i = 0; i < N; i++) {
sum += L[i];
if (max < L[i]) {
max = L[i];
a = i;
}
}
sum -= L[a];
if (sum > L[a])
cout << "yes" << endl;
else
cout << "no" << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int *L = new int[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int max = 0;
int sum = 0;
int a;
for (int i = 0; i < N; i++) {
sum += L[i];
if (max < L[i]) {
max = L[i];
a = i;
}
}
sum -= L[a];
if (sum > L[a])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,682 | 936,683 | u064691502 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int l[N];
for (int i = 0; i < N; i++) {
cin >> l[i];
}
sort(l, l + N);
int x = 0;
for (int i = 0; i < N - 1; i++) {
x += l[i];
}
if (x > l[N]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int l[N];
for (int i = 0; i < N; i++) {
cin >> l[i];
}
sort(l, l + N);
int x = 0;
for (int i = 0; i < N - 1; i++) {
x += l[i];
}
if (x > l[N - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 936,690 | 936,691 | u540300321 | cpp |
p03136 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, max_ans, another_lenght;
another_lenght = 0;
cin >> n;
int L[n];
for (int i = 0; i < n; i++) {
cin >> L[i];
another_lenght += min(max_ans, L[i]);
max_ans = max(max_ans, L[i]);
}
if (max_ans < another_lenght) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
} | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, max_ans, another_lenght;
another_lenght = 0;
max_ans = 0;
cin >> n;
int L[n];
for (int i = 0; i < n; i++) {
cin >> L[i];
another_lenght += min(max_ans, L[i]);
max_ans = max(max_ans, L[i]);
}
if (max_ans < another_lenght) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
}
| [
"assignment.add"
] | 936,693 | 936,694 | u189404681 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int l[110];
int n;
int i;
int sum = 0;
int max = -1;
cin >> n;
for (i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
max = (max < l[i]) ? l[i] : max;
}
sum -= max;
if (sum < max)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int l[110];
int n;
int i;
int sum = 0;
int max = -1;
cin >> n;
for (i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
max = (max < l[i]) ? l[i] : max;
}
sum -= max;
if (sum > max)
cout << "Yes\n";
else
cout << "No\n";
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,698 | 936,699 | u634135595 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> sides(n, 0);
for (int i = 0; i < n; i++)
cin >> sides.at(i);
sort(sides.begin(), sides.end());
reverse(sides.begin(), sides.end());
int sum;
for (int i = 1; i < n; i++)
sum += sides.at(i);
if (sides.at(0) < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> sides(n, 0);
for (int i = 0; i < n; i++)
cin >> sides.at(i);
sort(sides.begin(), sides.end());
reverse(sides.begin(), sides.end());
int sum = 0;
for (int i = 1; i < n; i++)
sum += sides.at(i);
if (sides.at(0) < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"variable_declaration.value.change"
] | 936,700 | 936,701 | u598501138 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[1000];
int main() {
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
sum -= a[n - 1];
if (sum > a[n - 1])
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
int a[1000];
int main() {
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
sum -= a[n - 1];
if (sum > a[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,704 | 936,705 | u246320765 | cpp |
p03136 | #include <bits/stdc++.h>
#define W(x) cout << #x << " = " << x << endl;
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define sort(x) sort(x.begin(), x.end())
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vet(n);
int soma = 0;
int maior = -1;
for (auto &p : vet) {
cin >> p;
soma += p;
maior = max(maior, p);
}
cout << (soma - maior > maior ? "YES\n" : "NO\n");
return 0;
}
| #include <bits/stdc++.h>
#define W(x) cout << #x << " = " << x << endl;
#define pii pair<int, int>
#define ff first
#define ss second
#define ll long long
#define sort(x) sort(x.begin(), x.end())
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vet(n);
int soma = 0;
int maior = -1;
for (auto &p : vet) {
cin >> p;
soma += p;
maior = max(maior, p);
}
cout << (soma - maior > maior ? "Yes\n" : "No\n");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,708 | 936,709 | u218547786 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int l[15];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
}
sort(l, l + n);
reverse(l, l + n);
cout << (l[0] < sum - l[0] ? "Yes" : "No") << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int l[15];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
}
sort(l, l + n);
reverse(l, l + n);
cout << (l[0] < sum - l[0] ? "Yes" : "No") << endl;
} | [] | 936,716 | 936,717 | u990764614 | cpp |
p03136 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int n;
int total = 0;
cin >> n;
vector<int> l(n);
FOR(i, 0, n - 1) {
cin >> l[i];
total += l[i];
}
sort(l.begin(), l.end());
if (total - l[n - 1] < l[n - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define LFOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define LRFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define INF 1000000000 // 2000000000
#define LLINF 1000000000000000000 // 9000000000000000000
#define PI 3.14159265358979
#define MAXI 7500000
using namespace std;
typedef long long int ll;
typedef pair<long long int, long long int> P;
int dy[5] = {0, 0, 1, -1, 0};
int dx[5] = {1, -1, 0, 0, 0};
int main(void) {
int n;
int total = 0;
cin >> n;
vector<int> l(n);
FOR(i, 0, n - 1) {
cin >> l[i];
total += l[i];
}
sort(l.begin(), l.end());
if (total - l[n - 1] > l[n - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,725 | 936,726 | u057611820 | cpp |
p03136 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N, L[100], Lmax = 1, maxnumber, addnumber = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> L[i];
if (Lmax < L[i]) {
Lmax = L[i];
maxnumber = i;
}
}
for (int i = 0; i < N; i++) {
addnumber += L[i];
if (i == maxnumber)
addnumber -= L[i];
}
if (Lmax <= addnumber) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N, L[100], Lmax = 1, maxnumber, addnumber = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> L[i];
if (Lmax < L[i]) {
Lmax = L[i];
maxnumber = i;
}
}
for (int i = 0; i < N; i++) {
addnumber += L[i];
if (i == maxnumber)
addnumber -= L[i];
}
// cout << Lmax << endl << addnumber << endl;
if (Lmax < addnumber) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,727 | 936,728 | u243458685 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, l[11], max = 0, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
if (l[i] > max) {
max = l[i];
}
}
if (2 * max < sum) {
printf("YES");
} else {
printf("NO");
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, l[11], max = 0, sum = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
if (l[i] > max) {
max = l[i];
}
}
if (2 * max < sum) {
printf("Yes");
} else {
printf("No");
}
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 936,731 | 936,732 | u061912210 | 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 add = 0;
for (int i = 0; i < N - 1; i++) {
add += L.at(i);
}
if (L.at(N - 1) > add) {
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 add = 0;
for (int i = 0; i < N - 1; i++) {
add += L.at(i);
}
if (L.at(N - 1) < add) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,741 | 936,742 | u445617209 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int maxv = 0;
int s = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] > maxv) {
s += maxv;
maxv = a[i];
} else
s += a[i];
}
if (maxv > s)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int maxv = 0;
int s = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] > maxv) {
s += maxv;
maxv = a[i];
} else
s += a[i];
}
if (maxv < s)
cout << "Yes";
else
cout << "No";
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,745 | 936,746 | u950909548 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll, ll> ii;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define RST(i, n) memset(i, n, sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) \
do { \
fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, \
#__VA_ARGS__); \
_do(__VA_ARGS__); \
} while (0)
template <typename T> void _do(T &&_x) { cerr << _x << endl; }
template <typename T, typename... S> void _do(T &&_x, S &&..._t) {
cerr << _x << ", ";
_do(_t...);
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, const pair<_a, _b> &_p) {
return _s << "(" << _p.X << "," << _p.Y << ")";
}
template <typename It> ostream &_OUTC(ostream &_s, It _ita, It _itb) {
_s << "{";
for (It _it = _ita; _it != _itb; _it++) {
_s << (_it == _ita ? "" : ",") << *_it;
}
_s << "}";
return _s;
}
template <typename _a> ostream &operator<<(ostream &_s, vector<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a> ostream &operator<<(ostream &_s, set<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, map<_a, _b> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _t> void pary(_t _a, _t _b) {
_OUTC(cerr, _a, _b);
cerr << endl;
}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#endif // cold66
//}
template <class T> inline bool chkmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chkmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
const ll MAXn = 15, MAXlg = __lg(MAXn) + 2;
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f;
ll d[MAXn];
int main() {
IOS();
ll n;
cin >> n;
REP(i, n) cin >> d[i];
sort(d, d + n);
ll sum = 0;
REP(i, n - 1) sum += d[i];
if (sum > d[n - 1])
cout << "YES" << endl;
else
cout << "NO" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll, ll> ii;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i <= n; i++)
#define RST(i, n) memset(i, n, sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) \
do { \
fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, \
#__VA_ARGS__); \
_do(__VA_ARGS__); \
} while (0)
template <typename T> void _do(T &&_x) { cerr << _x << endl; }
template <typename T, typename... S> void _do(T &&_x, S &&..._t) {
cerr << _x << ", ";
_do(_t...);
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, const pair<_a, _b> &_p) {
return _s << "(" << _p.X << "," << _p.Y << ")";
}
template <typename It> ostream &_OUTC(ostream &_s, It _ita, It _itb) {
_s << "{";
for (It _it = _ita; _it != _itb; _it++) {
_s << (_it == _ita ? "" : ",") << *_it;
}
_s << "}";
return _s;
}
template <typename _a> ostream &operator<<(ostream &_s, vector<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a> ostream &operator<<(ostream &_s, set<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, map<_a, _b> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _t> void pary(_t _a, _t _b) {
_OUTC(cerr, _a, _b);
cerr << endl;
}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#endif // cold66
//}
template <class T> inline bool chkmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chkmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
const ll MAXn = 15, MAXlg = __lg(MAXn) + 2;
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f;
ll d[MAXn];
int main() {
IOS();
ll n;
cin >> n;
REP(i, n) cin >> d[i];
sort(d, d + n);
ll sum = 0;
REP(i, n - 1) sum += d[i];
if (sum > d[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,747 | 936,748 | u829484206 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n, hoge, max, sum;
vector<int> l;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> hoge;
l.push_back(hoge);
}
auto itr = max_element(l.begin(), l.end());
sum = accumulate(l.begin(), l.end(), 0);
sum -= *itr * 2;
if (sum > *itr)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n, hoge, max, sum;
vector<int> l;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> hoge;
l.push_back(hoge);
}
auto itr = max_element(l.begin(), l.end());
sum = accumulate(l.begin(), l.end(), 0);
sum -= *itr;
if (sum > *itr)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 936,764 | 936,765 | u902428263 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n, hoge, max, sum;
vector<int> l;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> hoge;
l.push_back(hoge);
}
auto itr = max_element(l.begin(), l.end());
sum = accumulate(l.begin(), l.end(), 0);
sum -= *itr * 2;
if (sum < *itr)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n, hoge, max, sum;
vector<int> l;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> hoge;
l.push_back(hoge);
}
auto itr = max_element(l.begin(), l.end());
sum = accumulate(l.begin(), l.end(), 0);
sum -= *itr;
if (sum > *itr)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,766 | 936,765 | u902428263 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, max = 0, i, sum = 0;
cin >> n;
int l[n];
for (i = 0; i < n; ++i) {
cin >> l[i];
}
for (i = 0; i < n; ++i) {
if (l[i] > max) {
max = l[i];
}
sum += l[i];
}
if (sum - max > max) {
cout << "YES";
} else {
cout << "NO";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, max = 0, i, sum = 0;
cin >> n;
int l[n];
for (i = 0; i < n; ++i) {
cin >> l[i];
}
for (i = 0; i < n; ++i) {
if (l[i] > max) {
max = l[i];
}
sum += l[i];
}
if (sum - max > max) {
cout << "Yes";
} else {
cout << "No";
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,769 | 936,770 | u010344022 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define swap(a, b) ((a != b) && (a += b, b = a - b, a -= b))
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int sum = 0;
int max = 0;
int a, n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum = +a;
if (a > max)
max = a;
}
sum -= max;
string s;
if (sum > max)
s = "Yes";
else
s = "No";
cout << s << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define swap(a, b) ((a != b) && (a += b, b = a - b, a -= b))
using namespace std;
int gcd(int a, int b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int main() {
int sum = 0;
int max = 0;
int a, n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
sum += a;
if (a > max)
max = a;
}
sum -= max;
string s;
if (sum > max)
s = "Yes";
else
s = "No";
cout << s << endl;
return 0;
}
| [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove"
] | 936,771 | 936,772 | u061071198 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
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])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
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;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 936,773 | 936,774 | u426397594 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int n;
cin >> n;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
sort(l, l + n);
int sum = 0;
for (int i = 1; i < n; i++) {
sum += l[i];
}
if (sum > l[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MAX 100000
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int n;
cin >> n;
int l[n];
for (int i = 0; i < n; i++) {
cin >> l[i];
}
sort(l, l + n, greater<>());
int sum = 0;
for (int i = 1; i < n; i++) {
sum += l[i];
}
if (sum > l[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"call.arguments.add"
] | 936,775 | 936,776 | u160036974 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, sum = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L, L + N);
for (int i = 0; i < N - 1; i++) {
sum += L[i];
}
if (sum < L[N - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, sum = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L, L + N);
for (int i = 0; i < N - 1; i++) {
sum += L[i];
}
if (sum > L[N - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,779 | 936,780 | u341488930 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
int N;
cin >> N;
vector<int> L(N);
REP(i, N) { cin >> L.at(i); }
sort(ALL(L));
reverse(ALL(L));
int sum = 0;
REP(i, N) {
if (i != 0) {
sum += L.at(i);
}
}
if (L.at(0) < sum) {
cout << "Yse" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
int N;
cin >> N;
vector<int> L(N);
REP(i, N) { cin >> L.at(i); }
sort(ALL(L));
reverse(ALL(L));
int sum = 0;
REP(i, N) {
if (i != 0) {
sum += L.at(i);
}
}
if (L.at(0) < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.string.change",
"io.output.change"
] | 936,781 | 936,782 | u408053343 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, i, s = 0, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> l;
s += l;
m = max(m, l);
}
if (2 * m < l) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, i, s = 0, m = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> l;
s += l;
m = max(m, l);
}
if (2 * m < s) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 936,787 | 936,788 | u058348416 | cpp |
p03136 | #include <bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(false); // cin.tie(NULL); cout.tie(NULL)
#define mp make_pair
#define pb push_back
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
/* BIEN CUC BO BEGIN*/
int n, m;
/* BIEN CUC BO END*/
void solve() {
cin >> n;
int su = 0;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
su += x;
m = max(m, x);
}
cout << (su - m > m ? "YES" : "NO");
}
int main() {
FIO;
solve();
return 0;
} | #include <bits/stdc++.h>
#define FIO ios_base::sync_with_stdio(false); // cin.tie(NULL); cout.tie(NULL)
#define mp make_pair
#define pb push_back
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
/* BIEN CUC BO BEGIN*/
int n, m;
/* BIEN CUC BO END*/
void solve() {
cin >> n;
int su = 0;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
su += x;
m = max(m, x);
}
cout << (su - m > m ? "Yes" : "No");
}
int main() {
FIO;
solve();
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,791 | 936,792 | u189629354 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(L, L + N);
for (int i = 0; i < N - 1; i++) {
sum += L[i];
}
if (L[N] < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
int L[N];
for (int i = 0; i < N; i++) {
cin >> L[i];
}
sort(L, L + N);
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;
} | [
"control_flow.branch.if.condition.change"
] | 936,793 | 936,794 | u274317341 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, sum;
cin >> N;
sum = 0, L = 0;
int x;
for (int i = 0; i < N; i++) {
cin >> x;
sum += x;
L = (L, x);
}
if (L < sum - L) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, L, sum;
cin >> N;
sum = 0, L = 0;
int x;
for (int i = 0; i < N; i++) {
cin >> x;
sum += x;
L = max(L, x);
}
if (L < sum - L) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"call.add"
] | 936,808 | 936,809 | u401900157 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int a, maxs, wa;
for (int i = 0; i < N; i++) {
cin >> a;
wa += a;
maxs = max(maxs, a);
}
wa - maxs;
cout << (wa > maxs ? "Yes" : "No") << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int a, maxs = 0, wa = 0;
for (int i = 0; i < N; i++) {
cin >> a;
wa += a;
maxs = max(maxs, a);
}
wa -= maxs;
cout << (wa > maxs ? "Yes" : "No") << endl;
return 0;
} | [
"variable_declaration.value.change",
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 936,812 | 936,813 | u174265495 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N, L, M = 0, S = 0;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> L;
if (M < L)
M = L;
S += L;
}
if (M > S - M)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int N, L, M = 0, S = 0;
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> L;
if (M < L)
M = L;
S += L;
}
if (M >= S - M)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,814 | 936,815 | u684556267 | cpp |
p03136 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 100000007
#define SIZE 10005
#define PI 3.14159265358979323846
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int Max = 0, Sum = 0;
REP(i, n) {
int Input;
cin >> Input;
if (Max < Input)
Max = Input;
Sum += Input;
}
cout << ((2 * Max <= Sum) ? "Yes" : "No") << endl;
return 0;
} | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FORR(i, n, m) for (int i = n - 1; i >= m; i--)
#define all(in) in.begin(), in.end()
#define ALL(in, K) in, in + K
#define INF 1e18
#define MOD 100000007
#define SIZE 10005
#define PI 3.14159265358979323846
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int Max = 0, Sum = 0;
REP(i, n) {
int Input;
cin >> Input;
if (Max < Input)
Max = Input;
Sum += Input;
}
cout << ((2 * Max < Sum) ? "Yes" : "No") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 936,821 | 936,822 | u288432959 | cpp |
p03136 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define f(i, x, n) for (ll int i = x; i < n; i++)
#define re(j, x, n) for (ll int j = x; j >= n; j--)
#define f1(k, x, n) for (ll int k = x; k <= n; k++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n], sum = 0;
f(i, 0, n) cin >> a[i];
sort(a, a + n);
f(i, 0, n - 1) sum += a[i];
if (sum > a[n - 1])
cout << "Yes";
else
cout << "NO";
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define f(i, x, n) for (ll int i = x; i < n; i++)
#define re(j, x, n) for (ll int j = x; j >= n; j--)
#define f1(k, x, n) for (ll int k = x; k <= n; k++)
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int a[n], sum = 0;
f(i, 0, n) cin >> a[i];
sort(a, a + n);
f(i, 0, n - 1) sum += a[i];
if (sum > a[n - 1])
cout << "Yes";
else
cout << "No";
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,825 | 936,826 | u430650458 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
int maxL = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
maxL = max(L, maxL);
sum += L;
}
if (sum - maxL > maxL) {
cout << "Yes" << endl;
} else {
cout << "NO" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
int maxL = 0;
for (int i = 0; i < N; i++) {
int L;
cin >> L;
maxL = max(L, maxL);
sum += L;
}
if (sum - maxL > maxL) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,842 | 936,843 | u034810328 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int l[110];
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l, l + n, greater<int>());
int sum = 0;
for (int i = 0; i < n - 1; i++)
sum += l[1];
if (sum > l[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int l[110];
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l, l + n, greater<int>());
int sum = 0;
for (int i = 1; i < n; i++)
sum += l[i];
if (sum > l[0])
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variabl... | 936,850 | 936,851 | u525137785 | cpp |
p03136 | #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);
}
sort(vec.begin(), vec.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += vec.at(i);
}
if (vec.at(N - 1) > sum) {
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);
}
sort(vec.begin(), vec.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += vec.at(i);
}
if (vec.at(N - 1) < sum) {
cout << "Yes" << endl;
} else
cout << "No" << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,856 | 936,857 | u655404795 | cpp |
p03136 | ///*
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int *line, number;
int longest, others = 0;
cin >> number;
line = new int[number];
for (int i = 0; i < number; i++) {
cin >> line[i];
}
sort(line, line + number);
longest = line[number - 1];
for (int i = 0; i < number - 1; i++) {
others += line[i];
}
longest < others ? cout << "Yes" << endl : cout << "NO" << endl;
return 0;
}
//*/ | ///*
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int *line, number;
int longest, others = 0;
cin >> number;
line = new int[number];
for (int i = 0; i < number; i++) {
cin >> line[i];
}
sort(line, line + number);
longest = line[number - 1];
for (int i = 0; i < number - 1; i++) {
others += line[i];
}
/*debug
for (int i = 0; i < number; i++) {
cout << line[i] << " ";
}
cout << longest << " " << others << endl;
*/
longest < others ? cout << "Yes" << endl : cout << "No" << endl;
return 0;
}
//*/ | [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 936,866 | 936,867 | u589734885 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int max(int *array, int n) {
int max = 0;
for (int i = 0; i < n; i++) {
if (max < array[i])
max = array[i];
}
return max;
}
int sum(int *array, int n) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum += array[i];
}
return sum;
}
int main() {
int n;
int ls[105];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ls[i];
}
int max_l = max(ls, n);
int sum_l = sum(ls, n);
if (sum_l >= max_l)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int max(int *array, int n) {
int max = 0;
for (int i = 0; i < n; i++) {
if (max < array[i])
max = array[i];
}
return max;
}
int sum(int *array, int n) {
int sum = 0;
for (int i = 0; i < n; i++) {
sum += array[i];
}
return sum;
}
int main() {
int n;
int ls[105];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ls[i];
}
int max_l = max(ls, n);
int sum_l = sum(ls, n) - max_l;
if (sum_l > max_l)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,874 | 936,875 | u295621316 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define numarr 11
using namespace std;
int Lsum(int L[], int n, int N) {
int i, ans = 0;
for (i = 0; i < N; i++) {
if (i != n)
ans += L[i];
}
return ans;
}
int main() {
string can = "Yes";
int N, L[numarr], i;
cin >> N;
for (i = 0; i < N; i++)
cin >> L[i];
for (i = 1; i < N; i++) {
if (L[i] >= Lsum(L, i, N))
can = "No";
}
cout << can << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define numarr 12
using namespace std;
int Lsum(int L[], int n, int N) {
int i, ans = 0;
for (i = 0; i < N; i++) {
if (i != n)
ans += L[i];
}
return ans;
}
int main() {
string can = "Yes";
int N, L[numarr], i;
cin >> N;
for (i = 0; i < N; i++)
cin >> L[i];
for (i = 0; i < N; i++) {
if (L[i] >= Lsum(L, i, N))
can = "No";
}
cout << can << endl;
} | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 936,878 | 936,879 | u541884637 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
ans += a[i];
}
for (int i = 1; i <= n; i++) {
if (a[i] > (ans - a[i])) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
ans += a[i];
}
for (int i = 1; i <= n; i++) {
if (a[i] >= (ans - a[i])) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,880 | 936,881 | u504403442 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int l[N];
for (int i = 0; i < N; i++) {
cin >> l[i];
}
sort(l, l + N);
int a = l[N - 1];
int b = 0;
for (int i = 0; i < N - 1; i++) {
b = b + l[i];
}
if (a < b) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int l[N];
for (int i = 0; i < N; i++) {
cin >> l[i];
}
sort(l, l + N);
int a = l[N - 1];
int b = 0;
for (int i = 0; i < N - 1; i++) {
b = b + l[i];
}
if (a < b) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,882 | 936,883 | u467826805 | cpp |
p03136 | #include <algorithm>
#include <bitset>
// #include <boost/dynamic_bitset.hpp>
#include <cfloat>
#include <chrono>
#include <cmath>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define DEBUG(x) cout << #x << ": " << x << endl
#define INFILE() freopen("input.txt", "r", stdin)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define REPC(i, a) REP(i, 0, a)
#define RREP(i, a, b) for (int i = (a); i >= (b); i--)
#define RREPC(i, a) RREP(i, a, 0)
#define ALL(s) begin(s), end(s)
#define RALL(s) rbegin(s), rend(s)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i_i = pair<int, int>;
using ll_i = pair<ll, int>;
using i_ll = pair<int, ll>;
using d_i = pair<double, int>;
using ll_ll = pair<ll, ll>;
using d_d = pair<double, double>;
static constexpr ll LL_MOD = 1000000009;
static constexpr ll LL2_MOD = 1000000007;
static constexpr double EPS = numeric_limits<double>::epsilon();
static constexpr double PI = 3.14159265358979323846264338327950288;
static map<type_index, const char *const> scanType = {{typeid(int), "%d"},
{typeid(ll), "%lld"},
{typeid(double), "%lf"},
{typeid(char), "%c"}};
template <class T> static void scan(vector<T> &v);
static void scan(vector<string> &v, bool isWord = true);
// static boost::dynamic_bitset<> scan(char trueValue = 'o');
int main(int argc, char *argv[]) {
// INFILE();
int n;
cin >> n;
vector<int> v(n);
scan(v);
int max = -1;
for (const auto &a : v) {
if (a > max) {
max = a;
}
}
bool del = false;
int total = 0;
for (const auto &a : v) {
if (!del && a == max) {
continue;
}
total += a;
}
if (max < total) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
template <class T> static void scan(vector<T> &v) {
auto tFormat = scanType[typeid(T)];
for (T &n : v) {
scanf(tFormat, &n);
}
}
static void scan(vector<string> &v, bool isWord) {
if (isWord) {
for (auto &n : v) {
cin >> n;
}
return;
}
int i = 0, size = static_cast<int>(v.size());
string s;
getline(cin, s);
if (s.size() != 0) {
i++;
v[0] = s;
}
for (; i < size; ++i) {
getline(cin, v[i]);
}
}
// static boost::dynamic_bitset<> scan(char trueValue) {
// string s;
// getline(cin, s);
//
// if (s.size() == 0) {
// getline(cin, s);
// }
//
// for_each(begin(s), end(s),
// [trueValue](char &c) { c = (c == trueValue) ? '1' : '0'; });
// return boost::dynamic_bitset<>(string(rbegin(s), rend(s)));
//}
| #include <algorithm>
#include <bitset>
// #include <boost/dynamic_bitset.hpp>
#include <cfloat>
#include <chrono>
#include <cmath>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define DEBUG(x) cout << #x << ": " << x << endl
#define INFILE() freopen("input.txt", "r", stdin)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define REPC(i, a) REP(i, 0, a)
#define RREP(i, a, b) for (int i = (a); i >= (b); i--)
#define RREPC(i, a) RREP(i, a, 0)
#define ALL(s) begin(s), end(s)
#define RALL(s) rbegin(s), rend(s)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i_i = pair<int, int>;
using ll_i = pair<ll, int>;
using i_ll = pair<int, ll>;
using d_i = pair<double, int>;
using ll_ll = pair<ll, ll>;
using d_d = pair<double, double>;
static constexpr ll LL_MOD = 1000000009;
static constexpr ll LL2_MOD = 1000000007;
static constexpr double EPS = numeric_limits<double>::epsilon();
static constexpr double PI = 3.14159265358979323846264338327950288;
static map<type_index, const char *const> scanType = {{typeid(int), "%d"},
{typeid(ll), "%lld"},
{typeid(double), "%lf"},
{typeid(char), "%c"}};
template <class T> static void scan(vector<T> &v);
static void scan(vector<string> &v, bool isWord = true);
// static boost::dynamic_bitset<> scan(char trueValue = 'o');
int main(int argc, char *argv[]) {
// INFILE();
int n;
cin >> n;
vector<int> v(n);
scan(v);
int max = -1;
for (const auto &a : v) {
if (a > max) {
max = a;
}
}
bool del = false;
int total = 0;
for (const auto &a : v) {
if (!del && a == max) {
del = true;
continue;
}
total += a;
}
if (max < total) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
template <class T> static void scan(vector<T> &v) {
auto tFormat = scanType[typeid(T)];
for (T &n : v) {
scanf(tFormat, &n);
}
}
static void scan(vector<string> &v, bool isWord) {
if (isWord) {
for (auto &n : v) {
cin >> n;
}
return;
}
int i = 0, size = static_cast<int>(v.size());
string s;
getline(cin, s);
if (s.size() != 0) {
i++;
v[0] = s;
}
for (; i < size; ++i) {
getline(cin, v[i]);
}
}
// static boost::dynamic_bitset<> scan(char trueValue) {
// string s;
// getline(cin, s);
//
// if (s.size() == 0) {
// getline(cin, s);
// }
//
// for_each(begin(s), end(s),
// [trueValue](char &c) { c = (c == trueValue) ? '1' : '0'; });
// return boost::dynamic_bitset<>(string(rbegin(s), rend(s)));
//}
| [
"assignment.add"
] | 936,884 | 936,885 | u209647862 | cpp |
p03136 | #include "algorithm"
#include "array"
#include "functional"
#include "iostream"
#include "string"
#include "vector"
#include <math.h>
using namespace std;
#define rep(p, q) for (int i = p; i < q; i++)
// B
int main(void) {
int n;
cin >> n;
int max = 0, sum = 0;
rep(0, n) {
int x;
cin >> x;
if (x > max)
max = x;
sum += x;
}
if (sum - max > max)
cout << 'Yes' << endl;
else
cout << 'No' << endl;
} | #include "algorithm"
#include "array"
#include "functional"
#include "iostream"
#include "string"
#include "vector"
#include <math.h>
using namespace std;
#define rep(p, q) for (int i = p; i < q; i++)
// B
int main(void) {
int n;
cin >> n;
int max = 0, sum = 0;
rep(0, n) {
int x;
cin >> x;
if (x > max)
max = x;
sum += x;
}
if (sum - max > max)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"literal.string.change",
"io.output.change"
] | 936,886 | 936,887 | u693569496 | cpp |
p03136 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FORR(i, a, b) for (int i = (a); i >= (b); i--)
#define pb push_back
#define VDEL(v, n) v.erase(v.begin() + (n))
#define ALL(v) v.begin(), v.end()
#define INT_INF 200000000
#define TINT(str) atoi(str.c_str())
#define TSTR(num) to_string(num)
typedef long long ll;
typedef pair<int, int> PINT;
typedef vector<int> VI;
typedef vector<vector<int>> VII;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
// the end of library zone
signed main() {
int N;
int L[20];
cin >> N;
int maxv = 0;
int sum = 0;
REP(i, N) {
cin >> L[i];
maxv = max(maxv, L[i]);
sum += L[i];
}
if (maxv > (sum - maxv)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FORR(i, a, b) for (int i = (a); i >= (b); i--)
#define pb push_back
#define VDEL(v, n) v.erase(v.begin() + (n))
#define ALL(v) v.begin(), v.end()
#define INT_INF 200000000
#define TINT(str) atoi(str.c_str())
#define TSTR(num) to_string(num)
typedef long long ll;
typedef pair<int, int> PINT;
typedef vector<int> VI;
typedef vector<vector<int>> VII;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
// the end of library zone
signed main() {
int N;
int L[20];
cin >> N;
int maxv = 0;
int sum = 0;
REP(i, N) {
cin >> L[i];
maxv = max(maxv, L[i]);
sum += L[i];
}
if (maxv >= (sum - maxv)) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,888 | 936,889 | u465379376 | cpp |
p03136 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#define inf 999999999
using namespace std;
int l[100001];
signed main() {
int n, maxx = 999999999, sum = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &l[i]), maxx = max(maxx, l[i]), sum += l[i];
if (maxx >= sum - maxx)
printf("No");
else
printf("Yes");
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#define inf 999999999
using namespace std;
int l[100001];
signed main() {
int n, maxx = 0, sum = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &l[i]), maxx = max(maxx, l[i]), sum += l[i];
if (maxx >= sum - maxx)
printf("No");
else
printf("Yes");
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 936,900 | 936,901 | u413057858 | cpp |
p03136 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#define inf 999999999
using namespace std;
int l[100001];
signed main() {
int n, maxx = 999999999, sum = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &l[i]), maxx = max(maxx, l[i]), sum += l[i];
if (maxx > sum - maxx)
printf("No");
else
printf("Yes");
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#define inf 999999999
using namespace std;
int l[100001];
signed main() {
int n, maxx = 0, sum = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &l[i]), maxx = max(maxx, l[i]), sum += l[i];
if (maxx >= sum - maxx)
printf("No");
else
printf("Yes");
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,902 | 936,901 | u413057858 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<int> vi;
signed main() {
int n, sum = 0;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vector<int> l(20, 0);
rep(i, n) { cin >> l[i]; }
sort(l.begin(), l.end(), greater<int>());
rep(i, n - 1) { sum += l[i + 1]; }
if (l[0] < sum)
puts("YES");
else
puts("NO");
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define loop(i, a, n) for (int i = (a); (i) < (n); ++(i))
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF (int)1e9
#define MOD 0
//#define int ll
using namespace std;
typedef vector<int> vi;
signed main() {
int n, sum = 0;
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vector<int> l(20, 0);
rep(i, n) { cin >> l[i]; }
sort(l.begin(), l.end(), greater<int>());
rep(i, n - 1) { sum += l[i + 1]; }
if (l[0] < sum)
puts("Yes");
else
puts("No");
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 936,907 | 936,908 | u244583418 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
int sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
sum += v[i];
}
int max = *max_element(v.begin(), v.end());
if (2 * max < sum) {
cout << "YES"
<< "\n";
} else {
cout << "NO"
<< "\n";
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
int sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
sum += v[i];
}
int max = *max_element(v.begin(), v.end());
if (2 * max < sum) {
cout << "Yes"
<< "\n";
} else {
cout << "No"
<< "\n";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,909 | 936,910 | u811176339 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
map<int, int> mp;
map<int, int> mm;
#define ll long long
#define ld long double
#define PI 3.14159265358979l
int main() {
int n;
int l[100];
cin >> n;
int max = 0;
int sum;
rep(i, n) {
cin >> l[i];
if (l[i] > max)
max = l[i];
sum += l[i];
}
sum -= max;
if (max > sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
map<int, int> mp;
map<int, int> mm;
#define ll long long
#define ld long double
#define PI 3.14159265358979l
int main() {
int n;
int l[100];
cin >> n;
int max = 0;
int sum = 0;
rep(i, n) {
cin >> l[i];
if (l[i] > max)
max = l[i];
sum += l[i];
}
sum -= max;
if (max < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"variable_declaration.value.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,913 | 936,914 | u154672915 | cpp |
p03136 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, int> pli;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
using namespace std;
int main() {
int n;
cin >> n;
int l[n];
rep(i, n) cin >> l[n];
sort(l, l + n);
int sum = 0;
rep(i, n - 1) sum += l[i];
if (sum < l[n - 1])
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; ++i)
#define rep(i, n) REP(i, 0, n)
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, int> pli;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
using namespace std;
int main() {
int n;
cin >> n;
int l[n];
rep(i, n) cin >> l[i];
sort(l, l + n);
int sum = 0;
rep(i, n - 1) sum += l[i];
if (sum > l[n - 1])
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 936,915 | 936,916 | u906208439 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vector<long long> const &numbers,
string const &str) {
if (numbers.size() == 0)
return "";
string result = "" + to_string(numbers[0]);
for (long long i = 1; i < numbers.size(); i++) {
result += str;
result += to_string(numbers[i]);
}
return result;
}
//空白で区切る為のオーバーロード
static string MakeString_LongLong(vector<long long> const &numbers) {
if (numbers.size() == 0)
return "";
string result = "" + to_string(numbers[0]);
for (long long i = 1; i < numbers.size(); i++) {
result += " ";
result += to_string(numbers[i]);
}
return result;
}
//文字列の配列を改行を挟んでまとめる
static string MakeString_VectorString(vector<string> const &str) {
string result = "";
for (long long i = 0; i < str.size(); i++) {
result += str[i] + "\n";
}
return result;
}
//文字列を必要な個数だけ読み取る
static vector<string> MyReadLineSplit(LL n) {
vector<string> str(n);
for (long long i = 0; i < n; i++) {
std::cin >> str[i];
}
return str;
}
//数値を必要な個数だけ読み取る
static vector<long long> ReadInts(long long number) {
vector<long long> a(number);
for (int i = 0; i < number; i++) {
std::cin >> a[i];
}
return a;
}
//渡された自然数が素数ならtureを返す
static bool PrimeCheck_Int(long long number) {
if (number < 2)
return false;
for (ULL i = 2; i * i <= number; i++) {
if (number % i == 0)
return false;
}
return true;
}
//渡された数値以下の素数表を作る
static vector<long long> MakePrimeList(long long n) {
vector<long long> list;
LL i, j, p;
bool flag;
for (i = 2; i <= n; i++) {
flag = true;
for (j = 0; j < list.size(); j++) {
if (!(list[j] * list[j] <= i))
break;
if (i % list[j] == 0) {
flag = false;
break;
}
}
if (flag)
list.push_back(i);
}
return list;
}
//文字列の分割
static vector<string> split(string const &str, char sep) {
vector<std::string> v; // 分割結果を格納するベクター
auto first = str.begin(); // テキストの最初を指すイテレータ
while (first != str.end()) { // テキストが残っている間ループ
auto last = first; // 分割文字列末尾へのイテレータ
while (last != str.end() &&
*last != sep) // 末尾 or セパレータ文字まで進める
last++;
v.push_back(string(first, last)); // 分割文字を出力
if (last != str.end())
last++;
first = last; // 次の処理のためにイテレータを設定
}
return v;
}
//合計を求める
static LL Sum(vector<LL> a) {
LL i, sum = 0;
for (i = 0; i < a.size(); i++) {
sum += a[i];
}
return sum;
}
//小文字ならtrueを返す
static bool Komoji(char a) {
if (a >= 'a' && a <= 'z')
return true;
return false;
}
//大文字ならtrueを返す
static bool Oomoji(char a) {
if (a >= 'A' && a <= 'Z')
return true;
return false;
}
static LL GreatestCommonFactor(LL a, LL b) {
LL temp;
if (a < b) {
temp = b;
b = a;
a = temp;
}
while (true) {
temp = a % b;
a = b;
b = temp;
if (b == 0)
break;
}
return a;
}
static LL LeastCommonMultiple(LL a, LL b) {
return (a / GreatestCommonFactor(a, b)) * b;
}
};
//累積和を求めるクラス
class Syakutori {
private:
vector<LL> list;
public:
void MakeArray(vector<LL> data) {
LL i;
list = data;
list.push_back(0);
list[0] = 0;
for (i = 1; i < list.size(); i++) {
list[i] = list[i - 1] + data[i - 1];
}
}
LL Sum(LL start, LL end) {
if (end < start) {
cout << "startがendより大きいです";
return 0;
}
if (start < 0 || end >= list.size()) {
cout << "範囲が異常";
return 0;
}
return list[end] - list[start];
}
};
string strnum = "0123456789";
string alpS = "abcdefghijklmnopqrstuvwxyz";
string alpL = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int sizealp = (int)(alpS.size());
int mod = 1e9 + 7;
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 (sum < l[n - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<ULL> VULL;
class MYCP {
public:
//数値を区切って文字列にする
static string MakeString_LongLong(vector<long long> const &numbers,
string const &str) {
if (numbers.size() == 0)
return "";
string result = "" + to_string(numbers[0]);
for (long long i = 1; i < numbers.size(); i++) {
result += str;
result += to_string(numbers[i]);
}
return result;
}
//空白で区切る為のオーバーロード
static string MakeString_LongLong(vector<long long> const &numbers) {
if (numbers.size() == 0)
return "";
string result = "" + to_string(numbers[0]);
for (long long i = 1; i < numbers.size(); i++) {
result += " ";
result += to_string(numbers[i]);
}
return result;
}
//文字列の配列を改行を挟んでまとめる
static string MakeString_VectorString(vector<string> const &str) {
string result = "";
for (long long i = 0; i < str.size(); i++) {
result += str[i] + "\n";
}
return result;
}
//文字列を必要な個数だけ読み取る
static vector<string> MyReadLineSplit(LL n) {
vector<string> str(n);
for (long long i = 0; i < n; i++) {
std::cin >> str[i];
}
return str;
}
//数値を必要な個数だけ読み取る
static vector<long long> ReadInts(long long number) {
vector<long long> a(number);
for (int i = 0; i < number; i++) {
std::cin >> a[i];
}
return a;
}
//渡された自然数が素数ならtureを返す
static bool PrimeCheck_Int(long long number) {
if (number < 2)
return false;
for (ULL i = 2; i * i <= number; i++) {
if (number % i == 0)
return false;
}
return true;
}
//渡された数値以下の素数表を作る
static vector<long long> MakePrimeList(long long n) {
vector<long long> list;
LL i, j, p;
bool flag;
for (i = 2; i <= n; i++) {
flag = true;
for (j = 0; j < list.size(); j++) {
if (!(list[j] * list[j] <= i))
break;
if (i % list[j] == 0) {
flag = false;
break;
}
}
if (flag)
list.push_back(i);
}
return list;
}
//文字列の分割
static vector<string> split(string const &str, char sep) {
vector<std::string> v; // 分割結果を格納するベクター
auto first = str.begin(); // テキストの最初を指すイテレータ
while (first != str.end()) { // テキストが残っている間ループ
auto last = first; // 分割文字列末尾へのイテレータ
while (last != str.end() &&
*last != sep) // 末尾 or セパレータ文字まで進める
last++;
v.push_back(string(first, last)); // 分割文字を出力
if (last != str.end())
last++;
first = last; // 次の処理のためにイテレータを設定
}
return v;
}
//合計を求める
static LL Sum(vector<LL> a) {
LL i, sum = 0;
for (i = 0; i < a.size(); i++) {
sum += a[i];
}
return sum;
}
//小文字ならtrueを返す
static bool Komoji(char a) {
if (a >= 'a' && a <= 'z')
return true;
return false;
}
//大文字ならtrueを返す
static bool Oomoji(char a) {
if (a >= 'A' && a <= 'Z')
return true;
return false;
}
static LL GreatestCommonFactor(LL a, LL b) {
LL temp;
if (a < b) {
temp = b;
b = a;
a = temp;
}
while (true) {
temp = a % b;
a = b;
b = temp;
if (b == 0)
break;
}
return a;
}
static LL LeastCommonMultiple(LL a, LL b) {
return (a / GreatestCommonFactor(a, b)) * b;
}
};
//累積和を求めるクラス
class Syakutori {
private:
vector<LL> list;
public:
void MakeArray(vector<LL> data) {
LL i;
list = data;
list.push_back(0);
list[0] = 0;
for (i = 1; i < list.size(); i++) {
list[i] = list[i - 1] + data[i - 1];
}
}
LL Sum(LL start, LL end) {
if (end < start) {
cout << "startがendより大きいです";
return 0;
}
if (start < 0 || end >= list.size()) {
cout << "範囲が異常";
return 0;
}
return list[end] - list[start];
}
};
string strnum = "0123456789";
string alpS = "abcdefghijklmnopqrstuvwxyz";
string alpL = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int sizealp = (int)(alpS.size());
int mod = 1e9 + 7;
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 (sum > l[n - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,917 | 936,918 | u196798307 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int sm;
int mx;
sm = 0;
mx = 0;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
sm += l;
mx = max(mx, l);
}
if (mx < sm - mx)
cout << "Yes\n";
else
cout << "No\n";
cout << flush;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int sm;
int mx;
sm = 0;
mx = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int l;
cin >> l;
sm += l;
mx = max(mx, l);
}
if (mx < sm - mx)
cout << "Yes\n";
else
cout << "No\n";
cout << flush;
}
| [] | 936,919 | 936,920 | u506320030 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int L[100];
for (int i = 0; i < n; ++i) {
cin >> L[i];
}
sort(L, L + n, greater<int>());
int otherSum = 0;
for (int i = 1; i < n; i++) {
otherSum += L[i];
}
if (L[n - 1] < otherSum) {
cout << "Yes" << endl;
return 0;
} else {
cout << "No" << endl;
return 0;
}
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
int L[100];
for (int i = 0; i < n; ++i) {
cin >> L[i];
}
sort(L, L + n, greater<int>());
int otherSum = 0;
for (int i = 1; i < n; i++) {
otherSum += L[i];
}
if (L[0] < otherSum) {
cout << "Yes" << endl;
return 0;
} else {
cout << "No" << endl;
return 0;
}
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 936,921 | 936,922 | u223160139 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> lengths(n);
for (int i = 0; i < n; ++i) {
std::cin >> lengths[i];
}
int max = *std::max_element(lengths.begin(), lengths.end());
int total = std::accumulate(lengths.begin(), lengths.end(), 0);
std::cout << ((total - max) > max ? "YES" : "NO") << std::endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> lengths(n);
for (int i = 0; i < n; ++i) {
std::cin >> lengths[i];
}
int max = *std::max_element(lengths.begin(), lengths.end());
int total = std::accumulate(lengths.begin(), lengths.end(), 0);
std::cout << ((total - max) > max ? "Yes" : "No") << std::endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"expression.operation.binary.change"
] | 936,923 | 936,924 | u021625360 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define nl '\n'
#define si(i) scanf("%d", &i)
int nm, ma, su;
int main() {
cin >> nm;
for (int i = 0; i < nm; i++) {
int x;
cin >> x;
ma = max(x, ma);
su += x;
}
if (ma > su - ma)
cout << "Yes";
else
cout << "No";
} | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define nl '\n'
#define si(i) scanf("%d", &i)
int nm, ma, su;
int main() {
cin >> nm;
for (int i = 0; i < nm; i++) {
int x;
cin >> x;
ma = max(x, ma);
su += x;
}
if (ma < su - ma)
cout << "Yes";
else
cout << "No";
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,925 | 936,926 | u659781897 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
int main() {
int N, a = 0;
cin >> N;
VI L(N);
REP(i, N) cin >> L[i];
SORT(L);
for (int i = 0; i < N - 1; i++) {
a += L[i];
}
if (L[N - 1] < a)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
int main() {
int N, a = 0;
cin >> N;
VI L(N);
REP(i, N) cin >> L[i];
SORT(L);
for (int i = 0; i < N - 1; i++) {
a += L[i];
}
if (L[N - 1] < a)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,929 | 936,930 | u863044225 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.