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 | // Created by sz
#include <bits/stdc++.h>
using namespace std;
int N, L[11];
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N;
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L, L + N);
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L[i];
if (sum < L[N - 1])
cout << "No\n";
else
cout << "Yes\n";
return 0;
}
| // Created by sz
#include <bits/stdc++.h>
using namespace std;
int N, L[11];
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N;
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L, L + N);
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L[i];
if (sum <= L[N - 1])
cout << "No\n";
else
cout << "Yes\n";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,931 | 936,932 | u041075929 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
int l_sum = 0;
int i;
for (i = 0; i < n; i++) {
cin >> l[i];
l_sum += l[i];
}
sort(l.begin(), l.end());
l_sum -= l[n - 1];
cout << (l_sum > l[n - 1] ? "YES" : "NO") << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
int l_sum = 0;
int i;
for (i = 0; i < n; i++) {
cin >> l[i];
l_sum += l[i];
}
sort(l.begin(), l.end());
l_sum -= l[n - 1];
cout << (l_sum > l[n - 1] ? "Yes" : "No") << endl;
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,933 | 936,934 | u883104091 | cpp |
p03136 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
int n;
int l[13];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l, l + n);
int ss = 0;
for (int i = 0; i < n - 1; i++)
ss += l[i];
if (ss <= l[n - 1])
cout << "No";
cout << "Yes";
} | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
int n;
int l[13];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l, l + n);
int ss = 0;
for (int i = 0; i < n - 1; i++)
ss += l[i];
if (ss <= l[n - 1])
cout << "No";
else
cout << "Yes";
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 936,935 | 936,936 | u937608388 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
for (int i = 0; i < n - 1; i++) {
sum += v[i];
}
if (sum < v[n - 1]) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
int sum = 0;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
for (int i = 0; i < n - 1; i++) {
sum += v[i];
}
if (sum <= v[n - 1]) {
cout << "No";
} else {
cout << "Yes";
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,937 | 936,938 | u887066391 | cpp |
p03136 | #include <stdio.h>
int min(int x, int y) { return x < y ? x : y; }
int max(int x, int y) { return x > y ? x : y; }
int n, m, sum;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
m = max(m, x);
sum += x;
}
if (2 * m < sum) {
printf("YES");
} else {
printf("NO");
}
} | #include <stdio.h>
int min(int x, int y) { return x < y ? x : y; }
int max(int x, int y) { return x > y ? x : y; }
int n, m, sum;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
m = max(m, x);
sum += x;
}
if (2 * m < sum) {
printf("Yes");
} else {
printf("No");
}
} | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 936,939 | 936,940 | u887771535 | cpp |
p03136 | /* Accepted. */
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAXN 200000
int n, s, maxn, cur;
int main() {
// freopen( "input","r",stdin );
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> cur, s += cur, maxn = max(maxn, cur);
}
puts(maxn < s - maxn ? "YES" : "NO");
} // qwq
| /* Accepted. */
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAXN 200000
int n, s, maxn, cur;
int main() {
// freopen( "input","r",stdin );
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> cur, s += cur, maxn = max(maxn, cur);
}
puts(maxn < s - maxn ? "Yes" : "No");
} // qwq
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 936,943 | 936,944 | u390140944 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
static ll imin = std::numeric_limits<ll>::min();
static ll imax = std::numeric_limits<ll>::max();
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define rep1(i, n) for (int i = 1; (i) < (n); ++(i))
#define rev_rep(i, n) for (int i = (n)-1; (i) >= 0; --(i))
#define range(a, i, b) for (int i = (a); (i) < (b); ++(i))
#define dump(x) cout << #x << ":" << x << "\n";
#define all(v) v.begin(), v.end()
#define readl(N) \
ll N; \
cin >> N
#define readlv(N, vec) \
vector<ll> vec(N); \
rep(i, N) { cin >> vec[i]; }
#define greater_than [](ll l, ll r) { return l > r; }
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::map<T1, T2> &mp);
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> &pair);
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &vec);
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> &pair) {
os << '(' << pair.first << ',' << pair.second << ')';
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &vec) {
std::size_t n = vec.size();
if (n == 0) {
return os;
}
os << " ";
for (ll i = 0; i < n - 1; ++i) {
os << vec[i] << " ";
}
os << vec[n - 1];
os << std::endl;
return os;
}
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::map<T1, T2> &mp) {
std::size_t n = mp.size();
if (n == 0) {
return os;
}
os << " ";
for (auto &&x : mp) {
os << x << " ";
}
os << std::endl;
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> &mp) {
std::size_t n = mp.size();
if (n == 0) {
return os;
}
os << " ";
for (auto &&x : mp) {
os << x << " ";
}
os << std::endl;
return os;
}
template <class T> inline bool chmin(T &a, T const b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T const b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#ifndef BOOST_TEST_MAIN
int main(int const argc, char const **argv) {
readl(n);
vector<ll> l(n);
ll sum = 0;
rep(i, n) {
cin >> l[i];
sum += l[i];
}
sort(all(l));
if (sum >= l[n - 1] * 2) {
cout << "Yes";
} else {
cout << "No";
}
}
#endif
| #include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
static ll imin = std::numeric_limits<ll>::min();
static ll imax = std::numeric_limits<ll>::max();
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define rep1(i, n) for (int i = 1; (i) < (n); ++(i))
#define rev_rep(i, n) for (int i = (n)-1; (i) >= 0; --(i))
#define range(a, i, b) for (int i = (a); (i) < (b); ++(i))
#define dump(x) cout << #x << ":" << x << "\n";
#define all(v) v.begin(), v.end()
#define readl(N) \
ll N; \
cin >> N
#define readlv(N, vec) \
vector<ll> vec(N); \
rep(i, N) { cin >> vec[i]; }
#define greater_than [](ll l, ll r) { return l > r; }
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::map<T1, T2> &mp);
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> &pair);
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &vec);
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> &pair) {
os << '(' << pair.first << ',' << pair.second << ')';
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &vec) {
std::size_t n = vec.size();
if (n == 0) {
return os;
}
os << " ";
for (ll i = 0; i < n - 1; ++i) {
os << vec[i] << " ";
}
os << vec[n - 1];
os << std::endl;
return os;
}
template <class T1, class T2>
std::ostream &operator<<(std::ostream &os, std::map<T1, T2> &mp) {
std::size_t n = mp.size();
if (n == 0) {
return os;
}
os << " ";
for (auto &&x : mp) {
os << x << " ";
}
os << std::endl;
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, std::set<T> &mp) {
std::size_t n = mp.size();
if (n == 0) {
return os;
}
os << " ";
for (auto &&x : mp) {
os << x << " ";
}
os << std::endl;
return os;
}
template <class T> inline bool chmin(T &a, T const b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T const b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#ifndef BOOST_TEST_MAIN
int main(int const argc, char const **argv) {
readl(n);
vector<ll> l(n);
ll sum = 0;
rep(i, n) {
cin >> l[i];
sum += l[i];
}
sort(all(l));
// dump(l);
// dump(sum);
// dump(l[n - 1]);
if (sum > l[n - 1] * 2) {
cout << "Yes";
} else {
cout << "No";
}
}
#endif
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,945 | 936,946 | u068362919 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define vl vector<long long>
using pll = pair<long long, long long>;
#define __ << '\n'
#define _ << ' '
#define all(x) (x).begin(), (x).end()
void error() {
cout << "-1";
exit(0);
}
#define flush fflush(stdout)
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
ll n;
cin >> n;
vector<ll> ot(n);
for (auto i = 0; i < n; i++)
cin >> ot[i];
ll ma = -1;
ll sum = 0;
for (auto e : ot) {
sum += e;
ma = max(ma, e);
}
if (ma < sum) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define vl vector<long long>
using pll = pair<long long, long long>;
#define __ << '\n'
#define _ << ' '
#define all(x) (x).begin(), (x).end()
void error() {
cout << "-1";
exit(0);
}
#define flush fflush(stdout)
int main() {
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
ll n;
cin >> n;
vector<ll> ot(n);
for (auto i = 0; i < n; i++)
cin >> ot[i];
ll ma = -1;
ll sum = 0;
for (auto e : ot) {
sum += e;
ma = max(ma, e);
}
if (ma < sum - ma) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 936,947 | 936,948 | u879931038 | cpp |
p03136 | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
static const int giga = pow(10, 9);
// double pi = 3.141592653589793238463;
int main(void) {
int n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
a[i] = temp;
}
sort(a.begin(), a.end());
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += a[i];
}
if (sum < a[n - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iomanip>
#include <iostream>
// std::cout << std::setprecision(2) << 3.141; // "3.1"
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef pair<double, ll> pdlg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
typedef tuple<double, double, double> tddd;
static const int giga = pow(10, 9);
// double pi = 3.141592653589793238463;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
a[i] = temp;
}
sort(a.begin(), a.end());
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum += a[i];
}
if (sum > a[n - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,951 | 936,952 | u746560455 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a[20];
cin >> N;
for (int i = 0; i != N; i++) {
cin >> a[i];
}
sort(a, a + N);
int b = 0;
for (int i = 0; i != N - 1; i++) {
b += a[i];
}
if (b > a[N]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int a[20];
cin >> N;
for (int i = 0; i != N; i++) {
cin >> a[i];
}
sort(a, a + N);
int b = 0;
for (int i = 0; i != N - 1; i++) {
b += a[i];
}
if (b > a[N - 1]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"control_flow.branch.if.condition.change"
] | 936,953 | 936,954 | u118875091 | cpp |
p03136 | // By Sho10 aka JuniorMonster
#include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout << s, 0
using namespace std;
int32_t main() {
ll int s = 0, n, a[1000];
cin >> n;
for (ll int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (ll int i = 0; i < n - 1; i++)
s = s + a[i];
if (a[n - 1] < s) {
cout << "YES";
} else
cout << "NO";
return 0;
}
| // By Sho10 aka JuniorMonster
#include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout << s, 0
using namespace std;
int32_t main() {
ll int s = 0, n, a[1000];
cin >> n;
for (ll int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (ll int i = 0; i < n - 1; i++)
s = s + a[i];
if (a[n - 1] < s) {
cout << "Yes";
} else
cout << "No";
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 936,955 | 936,956 | u794807449 | cpp |
p03136 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define bit_cnt(n) (__builtin_popcountll(n))
#define substr(s, f, t) (s.substr(f - 1, t - f + 1))
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" : "NO") << endl;
using namespace std;
struct Grid {
ll x, y, t;
};
struct Edge {
ll to, cost;
};
struct Graph {
vector<vector<Edge>> E;
int V;
const ll Inf = llINF;
const int MAX_V = 201010;
vector<ll> d;
Graph(int n) : E(n) {
d.resize(MAX_V);
E.resize(n);
V = n;
}
void init() {
for (int i = 0; i < MAX_V; i++)
d[i] = Inf;
}
void add_edge(ll from, ll to, ll cost) { E[from].pb({to, cost}); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi L(n);
bool flag = true;
for (int i = 0; i < n; i++)
cin >> L[i];
for (int i = 0; i < n; i++) {
ll sum = 0;
for (int j = 0; j < n; j++)
if (i != j)
sum += L[j];
if (sum > L[i])
flag = false;
}
Yes(flag);
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define bit_cnt(n) (__builtin_popcountll(n))
#define substr(s, f, t) (s.substr(f - 1, t - f + 1))
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" : "NO") << endl;
using namespace std;
struct Grid {
ll x, y, t;
};
struct Edge {
ll to, cost;
};
struct Graph {
vector<vector<Edge>> E;
int V;
const ll Inf = llINF;
const int MAX_V = 201010;
vector<ll> d;
Graph(int n) : E(n) {
d.resize(MAX_V);
E.resize(n);
V = n;
}
void init() {
for (int i = 0; i < MAX_V; i++)
d[i] = Inf;
}
void add_edge(ll from, ll to, ll cost) { E[from].pb({to, cost}); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi L(n);
bool flag = true;
for (int i = 0; i < n; i++)
cin >> L[i];
for (int i = 0; i < n; i++) {
ll sum = 0;
for (int j = 0; j < n; j++)
if (i != j)
sum += L[j];
// cout<<sum<<" "<<L[i]<<endl;
if (sum <= L[i])
flag = false;
}
Yes(flag);
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,965 | 936,966 | u905715926 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l.rbegin(), l.rend());
int s = 0;
for (int i = 1; i < n; i++)
s += l[i];
if (l[0] > s)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l.rbegin(), l.rend());
int s = 0;
for (int i = 1; i < n; i++)
s += l[i];
if (l[0] < s)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,969 | 936,970 | u809153881 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l.rbegin(), l.rend());
int s = 0;
for (int i = 1; i < n; i++)
s += l[i];
if (l[0] > s)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l.rbegin(), l.rend());
int s = 0;
for (int i = 1; i < n; i++)
s += l[i];
if (l[0] < s)
cout << "Yes";
else
cout << "No";
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,971 | 936,970 | u809153881 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int L[N];
int sum = 0, m = 0;
rep(i, 0, ) {
cin >> L[i];
sum += L[i];
m = max(m, L[i]);
}
cout << (m <= sum - m ? "Yes" : "No") << "\n";
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int L[N];
int sum = 0, m = 0;
rep(i, 0, N) {
cin >> L[i];
sum += L[i];
m = max(m, L[i]);
}
cout << (m < sum - m ? "Yes" : "No") << "\n";
} | [
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 936,972 | 936,973 | u235155157 | cpp |
p03136 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int L[N];
int sum = 0, m = 0;
rep(i, 0, ) {
cin >> L[i];
sum += L[i];
m = max(m, L[i]);
}
cout << (m > sum - m ? "Yes" : "No") << "\n";
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define sz(v) (int)(v).size()
#define pb push_back
#define sc second
#define fr first
#define sor(v) sort(v.begin(), v.end())
#define rev(s) reverse(s.begin(), s.end())
#define lb(vec, a) lower_bound(vec.begin(), vec.end(), a)
#define ub(vec, a) upper_bound(vec.begin(), vec.end(), a)
#define uniq(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int L[N];
int sum = 0, m = 0;
rep(i, 0, N) {
cin >> L[i];
sum += L[i];
m = max(m, L[i]);
}
cout << (m < sum - m ? "Yes" : "No") << "\n";
} | [
"call.arguments.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 936,974 | 936,973 | u235155157 | cpp |
p03136 | /*
Look at the star
Look at the shine for U
*/
#include <bits/stdc++.h>
#define ll long long
#define PII pair<int, int>
#define sl(x) scanf("%lld", &x)
using namespace std;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
ll inv(ll b) {
if (b == 1)
return 1;
return (mod - mod / b) * inv(mod % b) % mod;
}
ll fpow(ll n, ll k) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = r * n % mod;
n = n * n % mod;
}
return r;
}
ll s[N];
int main() {
ll i, j, k, n;
sl(n);
for (i = 1; i <= n; i++)
sl(s[i]);
sort(s + 1, s + 1 + n);
ll sum = 0;
for (i = 1; i < n; i++)
sum += s[i];
if (sum >= s[n])
puts("No");
else
puts("Yes");
return 0;
} | /*
Look at the star
Look at the shine for U
*/
#include <bits/stdc++.h>
#define ll long long
#define PII pair<int, int>
#define sl(x) scanf("%lld", &x)
using namespace std;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1);
ll inv(ll b) {
if (b == 1)
return 1;
return (mod - mod / b) * inv(mod % b) % mod;
}
ll fpow(ll n, ll k) {
ll r = 1;
for (; k; k >>= 1) {
if (k & 1)
r = r * n % mod;
n = n * n % mod;
}
return r;
}
ll s[N];
int main() {
ll i, j, k, n;
sl(n);
for (i = 1; i <= n; i++)
sl(s[i]);
sort(s + 1, s + 1 + n);
ll sum = 0;
for (i = 1; i < n; i++)
sum += s[i];
if (sum <= s[n])
puts("No");
else
puts("Yes");
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 936,984 | 936,985 | u568831989 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define so sizeof
#define pb push_back
#define vl vector<ll>
#define forn(i, a, b) for (ll i = 1; i <= b; ++i)
#define forr(i, a, b) for (ll i = 0; i < b; ++i)
#define vll vector<pair<ll, ll>>
#define r0 return 0
#define be begin()
#define en end()
#define pll pair<ll, ll>
#define plll pair<ll, pair<ll, ll>>
#define plvl pair<pair<ll, ll>, ll>
#define mp make_pair
#define cf cout.flush()
int main() {
ios;
long long n;
cin >> n;
vl v;
forn(i, 1, n) {
ll x;
cin >> x;
v.pb(x);
}
sort(v.begin(), v.end());
ll foo = accumulate(v.be, v.en, 0);
foo = foo - v[0];
if (v[0] < foo)
cout << "Yes\n";
else
cout << "No\n";
r0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ios \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define so sizeof
#define pb push_back
#define vl vector<ll>
#define forn(i, a, b) for (ll i = 1; i <= b; ++i)
#define forr(i, a, b) for (ll i = 0; i < b; ++i)
#define vll vector<pair<ll, ll>>
#define r0 return 0
#define be begin()
#define en end()
#define pll pair<ll, ll>
#define plll pair<ll, pair<ll, ll>>
#define plvl pair<pair<ll, ll>, ll>
#define mp make_pair
#define cf cout.flush()
int main() {
ios;
long long n;
cin >> n;
vl v;
forn(i, 1, n) {
ll x;
cin >> x;
v.pb(x);
}
sort(v.begin(), v.end());
ll foo = accumulate(v.be, v.en, 0);
foo = foo - v[n - 1];
if (v[n - 1] < foo)
cout << "Yes\n";
else
cout << "No\n";
r0;
}
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change",
"control_flow.branch.if.condition.change"
] | 936,999 | 937,000 | u992394626 | cpp |
p03136 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define pb push_back
#define re return
#define fi first
#define se second
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<string> vs;
typedef vector<vi> vvi;
int n, a[11];
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cin >> n;
int sum = 0;
int mx = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
mx = max(mx, a[i]);
}
sum -= mx;
if (mx > sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define mp make_pair
#define pb push_back
#define re return
#define fi first
#define se second
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<string> vs;
typedef vector<vi> vvi;
int n, a[11];
int main() {
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
cin >> n;
int sum = 0;
int mx = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
mx = max(mx, a[i]);
}
sum -= mx;
if (mx < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 937,003 | 937,004 | u247996218 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
int m = 0, s = 0, n;
cin >> N;
while (N--) {
cin >> n;
s += n;
if (n > m)
m = n;
}
cout << ((m <= s - m) ? "Yes" : "No");
}
| #include <iostream>
using namespace std;
int main() {
int N;
int m = 0, s = 0, n;
cin >> N;
while (N--) {
cin >> n;
s += n;
if (n > m)
m = n;
}
cout << ((m < s - m) ? "Yes" : "No");
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 937,019 | 937,020 | u507693948 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int N;
int m = 0, s = 0, n;
cin >> N;
while (N--) {
cin >> n;
s += n;
if (n > m)
m = n;
}
cout << (m >= s - m) ? "Yes" : "No";
}
| #include <iostream>
using namespace std;
int main() {
int N;
int m = 0, s = 0, n;
cin >> N;
while (N--) {
cin >> n;
s += n;
if (n > m)
m = n;
}
cout << ((m < s - m) ? "Yes" : "No");
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 937,021 | 937,020 | u507693948 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rmsame(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define rmvector(a, b) \
rep(i, a.size()) rep(j, b.size()) if (a[i] == b[j]) { \
a.erase(a.begin() + i); \
i--; \
break; \
}
#define pq_pair_tB \
priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>
#define pq_pair_ts priority_queue<pair<ll, ll>> //第二成分の大きさが関係ない
template <typename X> bool exist(vector<X> vec, X item) {
return find(all(vec), item) != vec.end();
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll sum = 0;
ll m = 0;
rep(i, N) {
ll l;
cin >> l;
sum += l;
m = max(l, m);
}
sum -= m;
if (sum >= m)
cout << "No" << endl;
else
cout << "Yes" << endl;
// cout << fixed << setprecision(16) << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rmsame(a) sort(all(a)), a.erase(unique(all(a)), a.end())
#define rmvector(a, b) \
rep(i, a.size()) rep(j, b.size()) if (a[i] == b[j]) { \
a.erase(a.begin() + i); \
i--; \
break; \
}
#define pq_pair_tB \
priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>
#define pq_pair_ts priority_queue<pair<ll, ll>> //第二成分の大きさが関係ない
template <typename X> bool exist(vector<X> vec, X item) {
return find(all(vec), item) != vec.end();
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin >> N;
ll sum = 0;
ll m = 0;
rep(i, N) {
ll l;
cin >> l;
sum += l;
m = max(l, m);
}
sum -= m;
if (sum > m)
cout << "Yes" << endl;
else
cout << "No" << endl;
// cout << fixed << setprecision(16) << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 937,028 | 937,029 | u866107333 | cpp |
p03136 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, child, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (int i = (int)(begin), i##_end = (int)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, n, 0)
#define rrep3(i, begin, end) \
for (int i = (int)(begin - 1), i##_end = (int)(end); i >= i##_end; --i)
#define foreach(x, a) for (auto &x : a)
using ll = long long;
const ll mod = (ll)1e9 + 7;
//}}}
int L[10];
int main() {
int N;
rep(i, N) cin >> L[i];
int sum = 0;
rep(i, N) sum += L[i];
sort(L, L + N);
bool ans = L[N - 1] * 2 < sum;
puts(ans ? "Yes" : "No");
return 0;
}
| //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, child, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (int i = (int)(begin), i##_end = (int)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, n, 0)
#define rrep3(i, begin, end) \
for (int i = (int)(begin - 1), i##_end = (int)(end); i >= i##_end; --i)
#define foreach(x, a) for (auto &x : a)
using ll = long long;
const ll mod = (ll)1e9 + 7;
//}}}
int L[10];
int main() {
int N;
cin >> N;
rep(i, N) cin >> L[i];
int sum = 0;
rep(i, N) sum += L[i];
sort(L, L + N);
bool ans = L[N - 1] * 2 < sum;
puts(ans ? "Yes" : "No");
return 0;
}
| [] | 937,030 | 937,031 | u899220667 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <vector>
#define all(v) (v).begin(), (v).end()
using namespace std;
int main() {
int no_of_sides;
cin >> no_of_sides;
vector<int> length(no_of_sides);
for (int i = 0; i < no_of_sides; i++)
cin >> length[i];
sort(all(length));
int sum = 0;
for (int i = 0; i < no_of_sides - 1; i++)
sum += length[i];
cout << (sum < length[no_of_sides - 1] ? "Yes" : "No");
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
#define all(v) (v).begin(), (v).end()
using namespace std;
int main() {
int no_of_sides;
cin >> no_of_sides;
vector<int> length(no_of_sides);
for (int i = 0; i < no_of_sides; i++)
cin >> length[i];
sort(all(length));
int sum = 0;
for (int i = 0; i < no_of_sides - 1; i++)
sum += length[i];
cout << (sum > length[no_of_sides - 1] ? "Yes" : "No");
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 937,032 | 937,033 | u927253988 | cpp |
p03136 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int l[105];
int sum;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &l[i]);
sort(l, l + n);
for (int j = n - 2; j >= 0; j--)
sum += l[j];
if (l[n - 1] < sum)
puts("YES");
else
puts("NO");
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
int l[105];
int sum;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &l[i]);
sort(l, l + n);
for (int j = n - 2; j >= 0; j--)
sum += l[j];
if (l[n - 1] < sum)
puts("Yes");
else
puts("No");
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 937,036 | 937,037 | u128608381 | cpp |
p03136 | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
int n;
cin >> n;
int a[n], sum = 0, f = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
if (sum > 2 * a[i])
;
else
f = 0;
}
if (f)
cout << "YES" << endl;
else
cout << "NO" << endl;
} | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
int n;
cin >> n;
int a[n], sum = 0, f = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
if (sum > 2 * a[i])
;
else
f = 0;
}
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,041 | 937,042 | u006069211 | cpp |
p03136 | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
int n;
cin >> n;
int a[n], sum = 0, f = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
if (sum > 2 * a[i])
;
else
f = 0;
}
if (f)
cout << "YES" << endl;
cout << "NO" << endl;
} | //** aman**/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define dl double
#define hell 1000000007
#define endl '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
using namespace std;
int main() {
int n;
cin >> n;
int a[n], sum = 0, f = 1;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for (int i = 0; i < n; i++) {
if (sum > 2 * a[i])
;
else
f = 0;
}
if (f)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"literal.string.change",
"io.output.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 937,043 | 937,042 | u006069211 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int l[10];
int main(void) {
int n, s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l[i];
s += l[i];
}
sort(l, l + n);
s -= l[n - 1];
if (l[n - 1] > s)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int l[10];
int main(void) {
int n, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l[i];
sum += l[i];
}
sort(l, l + n);
sum -= l[n - 1];
if (l[n - 1] < sum)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"variable_declaration.name.change",
"identifier.change",
"assignment.variable.change"
] | 937,044 | 937,045 | u734774089 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int l[10];
int main(void) {
int n, s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l[i];
s += l[i];
}
sort(l, l + n);
s -= l[n - 1];
if (l[n - 1] > s)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int l[10];
int main(void) {
int n, s = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l[i];
s += l[i];
}
sort(l, l + n);
s -= l[n - 1];
if (l[n - 1] < s)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 937,044 | 937,046 | u734774089 | cpp |
p03136 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define REPR(i, s, n) for (int i = (s); i >= (n); i--)
#define pb push_back
#define pf push_front
typedef vector<int> vi;
typedef vector<string> vs;
typedef long long ll;
typedef vector<ll> vll;
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
ll lcm(ll x, ll y) {
x /= gcd(x, y);
y /= gcd(x, y);
return (x * y);
}
int main() {
int n, b, sum = 0;
vi l;
cin >> n;
rep(i, n) {
cin >> b;
l.pb(b);
}
sort(l.begin(), l.end());
rep(i, n - 1) { sum += l[i]; }
cout << (sum > l[n - 1] ? "Yes\n" : "N0\n");
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, s, n) for (int i = (s); i < (n); i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define REPR(i, s, n) for (int i = (s); i >= (n); i--)
#define pb push_back
#define pf push_front
typedef vector<int> vi;
typedef vector<string> vs;
typedef long long ll;
typedef vector<ll> vll;
ll gcd(ll x, ll y) {
ll r;
while ((r = x % y) != 0) {
x = y;
y = r;
}
return y;
}
ll lcm(ll x, ll y) {
x /= gcd(x, y);
y /= gcd(x, y);
return (x * y);
}
int main() {
int n, b, sum = 0;
vi l;
cin >> n;
rep(i, n) {
cin >> b;
l.pb(b);
}
sort(l.begin(), l.end());
rep(i, n - 1) { sum += l[i]; }
cout << (sum > l[n - 1] ? "Yes\n" : "No\n");
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 937,055 | 937,056 | u232429509 | cpp |
p03136 | #include <bits/stdc++.h>
using namespace std;
int n;
int a[15];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
int sum = 0;
for (int i = 1; i < n; i++)
sum += a[i];
if (sum < a[n])
puts("Yes");
else
puts("No");
} | #include <bits/stdc++.h>
using namespace std;
int n;
int a[15];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
int sum = 0;
for (int i = 1; i < n; i++)
sum += a[i];
if (a[n] < sum)
puts("Yes");
else
puts("No");
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 937,057 | 937,058 | u817240026 | cpp |
p03136 | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int nums[N];
int sum = 0;
int MX = -1;
for (int i = 0; i < N; i++) {
cin >> nums[i];
MX = max(MX, nums[i]);
sum += nums[i];
}
cout << ((MX <= sum - MX) ? "Yes" : "No");
}
| #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int nums[N];
int sum = 0;
int MX = -1;
for (int i = 0; i < N; i++) {
cin >> nums[i];
MX = max(MX, nums[i]);
sum += nums[i];
}
cout << ((MX < sum - MX) ? "Yes" : "No");
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 937,070 | 937,071 | u359856428 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
int main() {
int N;
int L[15] = {};
cin >> N;
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L, L + N);
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L[i];
if (sum < L[N - 1])
cout << "Yes";
else
cout << "No";
cout << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using lint = long long;
using namespace std;
int main() {
int N;
int L[15] = {};
cin >> N;
for (int i = 0; i < N; i++)
cin >> L[i];
sort(L, L + N);
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L[i];
if (L[N - 1] < sum)
cout << "Yes";
else
cout << "No";
cout << endl;
return 0;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 937,078 | 937,079 | u021423660 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max = 0;
int sum = 0;
int a[n];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max)
max = a[i];
sum += a[i];
}
if (max >= (sum - max))
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max = 0;
int sum = 0;
int a[10];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max)
max = a[i];
sum += a[i];
}
if (max >= (sum - max))
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change"
] | 937,080 | 937,081 | u638264018 | cpp |
p03136 | #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max = 0;
int sum = 0;
int a[n];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max)
max = a[i];
sum = sum + a[i];
}
if (max >= sum - max)
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max = 0;
int sum = 0;
int a[10];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max)
max = a[i];
sum += a[i];
}
if (max >= (sum - max))
cout << "No" << endl;
else
cout << "Yes" << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 937,082 | 937,081 | u638264018 | cpp |
p03136 | #include <cstdio>
int main() {
int a, n, m = 0, s = 0;
scanf("%d", &n);
while (n--) {
scanf("%d", &a);
s += a;
if (a > m)
m = a;
}
if (2 * m < s)
printf("YES");
else
printf("NO");
return 0;
}
| #include <cstdio>
int main() {
int a, n, m = 0, s = 0;
scanf("%d", &n);
while (n--) {
scanf("%d", &a);
s += a;
if (a > m)
m = a;
}
if (2 * m < s)
printf("Yes");
else
printf("No");
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 937,084 | 937,085 | u030635914 | cpp |
p03136 | #include <iostream>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
ll a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z;
int main() {
cin >> n;
int A[n];
int sum = 0;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
if (A[i] > max)
x = A[i];
}
if (sum - max > max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| #include <iostream>
#include <string>
#include <vector>
typedef long long int ll;
using namespace std;
ll a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z;
int main() {
cin >> n;
int A[n];
int sum = 0;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> A[i];
sum += A[i];
if (A[i] > max)
max = A[i];
}
if (sum - max > max) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"assignment.variable.change",
"identifier.change"
] | 937,086 | 937,087 | u789199225 | cpp |
p03136 | #include <bits/stdc++.h>
#define hell 1000000007
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll vector<pair<ll, ll>>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define F first
#define S second
#define rep(i, a, b) for (i = a; i < b; i++)
#define parr(a, n) \
for (i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << endl;
#define pcont(a) \
for (auto i : a) \
cout << i << " "; \
cout << endl;
#define ret(x) return cout << x, 0;
#define dbg(x) cout << #x << " is " << x << endl;
#define endl '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
ll a[n], i, j;
rep(i, 0, n) { cin >> a[i]; }
sort(a, a + n);
ll s = 0LL;
rep(i, 0, n - 1) { s += a[i]; }
if (a[i] < s) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
} | #include <bits/stdc++.h>
#define hell 1000000007
#define lcm(a, b) (a * b) / __gcd(a, b)
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll vector<pair<ll, ll>>
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define F first
#define S second
#define rep(i, a, b) for (i = a; i < b; i++)
#define parr(a, n) \
for (i = 0; i < n; i++) \
cout << a[i] << " "; \
cout << endl;
#define pcont(a) \
for (auto i : a) \
cout << i << " "; \
cout << endl;
#define ret(x) return cout << x, 0;
#define dbg(x) cout << #x << " is " << x << endl;
#define endl '\n'
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n;
cin >> n;
ll a[n], i, j;
rep(i, 0, n) { cin >> a[i]; }
sort(a, a + n);
ll s = 0LL;
rep(i, 0, n - 1) { s += a[i]; }
if (a[i] < s) {
cout << "Yes";
} else {
cout << "No";
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,088 | 937,089 | u493089152 | cpp |
p03136 | #include "bits/stdc++.h"
using namespace std;
void solve() {
int N, sum = 0;
cin >> N;
vector<int> ls(N);
for (int i = 0; i < N; i++) {
cin >> ls[i];
sum += ls[i];
}
sort(ls.begin(), ls.end());
cout << (ls.back() * 2 >= sum ? "Yes" : "No") << endl;
}
int main(void) {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
void solve() {
int N, sum = 0;
cin >> N;
vector<int> ls(N);
for (int i = 0; i < N; i++) {
cin >> ls[i];
sum += ls[i];
}
sort(ls.begin(), ls.end());
cout << (ls.back() * 2 < sum ? "Yes" : "No") << endl;
}
int main(void) {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 937,090 | 937,091 | u344412812 | cpp |
p03136 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L.push_back(x);
}
std::sort(L.begin(), L.end(), std::greater<int>());
int max = L[0];
L.erase(L.begin() + 0);
int sum = std::accumulate(L.begin(), L.end(), 0);
if (max < sum) {
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> L(N);
for (int i = 0; i < N; i++) {
int x;
cin >> x;
L.push_back(x);
}
std::sort(L.begin(), L.end(), std::greater<int>());
int max = L[0];
L.erase(L.begin() + 0);
int sum = std::accumulate(L.begin(), L.end(), 0);
if (max < sum) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,094 | 937,095 | u335104842 | cpp |
p03136 | #include <bits/stdc++.h>
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;
sum += L;
maxL = max(maxL, L);
}
if (maxL < sum - maxL) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
} | #include <bits/stdc++.h>
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;
sum += L;
maxL = max(maxL, L);
}
if (maxL < sum - maxL) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,096 | 937,097 | u130466814 | 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 tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.back() < tmp ? "YES" : "NO");
} | #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 tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.back() < tmp ? "Yes" : "No");
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,098 | 937,099 | u565172542 | 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 tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.at(N - 1) < tmp ? "YES" : "NO");
} | #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 tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.back() < tmp ? "Yes" : "No");
} | [
"call.function.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"expression.operation.binary.remove",
"literal.string.change",
"literal.string.case.change"
] | 937,100 | 937,099 | u565172542 | 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 tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.back() < tmp ? "YES" : "NO");
} | #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 tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.at(N - 1) < tmp ? "Yes" : "No");
} | [
"call.function.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"literal.string.change",
"literal.string.case.change"
] | 937,098 | 937,101 | u565172542 | 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 tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.at(N - 1) < tmp ? "YES" : "NO");
} | #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 tmp = 0;
for (int i = 0; i < N - 1; i++) {
tmp += L.at(i);
}
cout << (L.at(N - 1) < tmp ? "Yes" : "No");
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,100 | 937,101 | u565172542 | 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());
for (int i = 0; i < N - 1; i++) {
L.at(N - 1) -= L.at(i);
}
cout << (L.at(N - 1) < 0 ? "YES" : "NO");
} | #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());
for (int i = 0; i < N - 1; i++) {
L.at(N - 1) -= L.at(i);
}
cout << (L.at(N - 1) < 0 ? "Yes" : "No");
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,102 | 937,103 | u565172542 | cpp |
p03136 | #include <bits/stdc++.h>
int main() {
int n, sum, max = 0;
std::cin >> n;
for (auto i = 0; i < n; ++i) {
int v;
std::cin >> v;
if (v > max) {
max = v;
}
sum += v;
}
if ((sum - max) > max) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
int main() {
int n, sum = 0, max = 0;
std::cin >> n;
for (auto i = 0; i < n; ++i) {
int v;
std::cin >> v;
if (v > max) {
max = v;
}
sum += v;
}
if ((sum - max) > max) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
} | [
"variable_declaration.value.change"
] | 937,107 | 937,108 | u696729148 | cpp |
p03136 | #include <bits/stdc++.h>
int main() {
int n, sum, max = 0;
std::cin >> n;
for (auto i = 0; i < n; ++i) {
int v;
std::cin >> v;
if (v > max) {
max = v;
}
sum += v;
}
if ((sum - max) > max) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
}
| #include <bits/stdc++.h>
int main() {
int n, sum = 0, max = 0;
std::cin >> n;
for (auto i = 0; i < n; ++i) {
int v;
std::cin >> v;
if (v > max) {
max = v;
}
sum += v;
}
if ((sum - max) > max) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std::endl;
}
return 0;
} | [
"variable_declaration.value.change"
] | 937,109 | 937,108 | u696729148 | cpp |
p03136 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, sum, mx;
mx = 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];
for (int i = 0; i < N; ++i)
mx = max(mx, L[i]);
if (sum > 2 * mx)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, sum, mx;
sum = 0;
mx = 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];
for (int i = 0; i < N; ++i)
mx = max(mx, L[i]);
if (sum > 2 * mx)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| [
"assignment.add"
] | 937,117 | 937,118 | u041282550 | cpp |
p03136 | /*
They turn the lights down low,
In shadows hiding from the world,
Only coming out when it gets cold
The seas part when they hit the floor,
The voices carry on and out the door
And everything you touch turns into gold
Like the angel you are you laugh creating
A lightness in my chest,
Your eyes they penetrate me,
(your answer's always 'maybe')
That's when I got up and left
A beating heart and a microphone,
A ticking clock in an empty home
Still tells of these times so long ago,
Even though I've come so far,
I know I've got so far to go
And any day now I'll explode
Like the angel you are you laugh creating
A lightness in my chest,
Your eyes they penetrate me,
(your answer's always 'maybe')
That's when I got up and left
And each and everyday will lead into tomorrow
Tomorrow brings one less day without you
But don't wait up just leave the light on
'Cause all the roads that I might take
Will all one day lead back to you
And like the angel you are you laugh creating
A lightness in my chest,
Your eyes they penetrate me,
(never cease to amaze me)
That's when I got up and left
*/
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#include <assert.h>
#include <memory.h>
#define y0 sdkfaslhagaklsldk
#define y1 aasdfasdfasdf
#define yn askfhwqriuperikldjk
#define j1 assdgsdgasghsf
#define tm sdfjahlfasfh
#define lr asgasgash
#define norm asdfasdgasdgsd
#define have adsgagshdshfhds
#define ends asdgahhfdsfshdshfd
#define prev asdgSHJsfgsdfhdsh
#define hash asdgasdgasdgdfrywewery
#define eps 1e-12
#define M_PI 3.141592653589793
#define bsize 300
#define ldouble long double
using namespace std;
#define bs 1000000007
const int N = 600031;
int n, s, mx;
int main() {
// freopen("apache.in","r",stdin);
// freopen("apache.out","w",stdout);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// ios_base::sync_with_stdio(0);
// cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
int val;
cin >> val;
mx = max(mx, val);
s += val;
}
if (mx > (s - mx))
cout << "YES" << endl;
else
cout << "NO" << endl;
// cin.get(); cin.get();
return 0;
}
| /*
They turn the lights down low,
In shadows hiding from the world,
Only coming out when it gets cold
The seas part when they hit the floor,
The voices carry on and out the door
And everything you touch turns into gold
Like the angel you are you laugh creating
A lightness in my chest,
Your eyes they penetrate me,
(your answer's always 'maybe')
That's when I got up and left
A beating heart and a microphone,
A ticking clock in an empty home
Still tells of these times so long ago,
Even though I've come so far,
I know I've got so far to go
And any day now I'll explode
Like the angel you are you laugh creating
A lightness in my chest,
Your eyes they penetrate me,
(your answer's always 'maybe')
That's when I got up and left
And each and everyday will lead into tomorrow
Tomorrow brings one less day without you
But don't wait up just leave the light on
'Cause all the roads that I might take
Will all one day lead back to you
And like the angel you are you laugh creating
A lightness in my chest,
Your eyes they penetrate me,
(never cease to amaze me)
That's when I got up and left
*/
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#include <assert.h>
#include <memory.h>
#define y0 sdkfaslhagaklsldk
#define y1 aasdfasdfasdf
#define yn askfhwqriuperikldjk
#define j1 assdgsdgasghsf
#define tm sdfjahlfasfh
#define lr asgasgash
#define norm asdfasdgasdgsd
#define have adsgagshdshfhds
#define ends asdgahhfdsfshdshfd
#define prev asdgSHJsfgsdfhdsh
#define hash asdgasdgasdgdfrywewery
#define eps 1e-12
#define M_PI 3.141592653589793
#define bsize 300
#define ldouble long double
using namespace std;
#define bs 1000000007
const int N = 600031;
int n, s, mx;
int main() {
// freopen("apache.in","r",stdin);
// freopen("apache.out","w",stdout);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// ios_base::sync_with_stdio(0);
// cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
int val;
cin >> val;
mx = max(mx, val);
s += val;
}
if (mx < (s - mx))
cout << "Yes" << endl;
else
cout << "No" << endl;
// cin.get(); cin.get();
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 937,125 | 937,126 | u806695213 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mxn = 5e5 + 5;
// check for forloop
// intialize variable
// overflow
// go for easy solution
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
rishabh();
int t;
t = 1;
while (t--) {
int n, k;
cin >> k >> n;
vector<ll> vec, diff;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec.push_back(x);
}
if (vec.size() == 1) {
cout << 0;
return 0;
}
sort(vec.begin(), vec.end());
ll ans = 0;
priority_queue<ll> pq;
for (int i = 1; i < n; i++) {
ans = ans + vec[i] - vec[i - 1];
pq.push(vec[i] - vec[i - 1]);
}
while (k-- && !pq.empty()) {
ans = ans - pq.top();
pq.pop();
}
cout << ans;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mxn = 5e5 + 5;
// check for forloop
// intialize variable
// overflow
// go for easy solution
#define mod 1000000007
ll INF = 1000000000000000005LL;
#define endl '\n'
void rishabh() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
rishabh();
int t;
t = 1;
while (t--) {
int n, k;
cin >> k >> n;
vector<ll> vec, diff;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
vec.push_back(x);
}
if (vec.size() == 1) {
cout << 0;
return 0;
}
sort(vec.begin(), vec.end());
ll ans = 0;
priority_queue<ll> pq;
for (int i = 1; i < n; i++) {
ans = ans + vec[i] - vec[i - 1];
pq.push(vec[i] - vec[i - 1]);
}
while (k-- > 1 && !pq.empty()) {
ans = ans - pq.top();
pq.pop();
}
cout << ans;
}
} | [
"control_flow.loop.condition.change"
] | 937,154 | 937,155 | u577654787 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int x[100000];
int d[100000];
signed main() {
cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> x[i];
if (n >= m) {
puts("0");
return 0;
}
sort(x, x + m);
priority_queue<pair<int, int>> pq;
int sum = 0;
for (int i = 0; i < m - 1; i++) {
d[i] = x[i + 1] - x[i];
sum += d[i];
pq.emplace(d[i], i);
}
cerr << sum << endl;
while (n > 0) {
auto p = pq.top();
pq.pop();
sum -= p.first;
n -= 2;
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int n, m;
int x[100000];
int d[100000];
signed main() {
cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> x[i];
if (n >= m) {
puts("0");
return 0;
}
sort(x, x + m);
priority_queue<pair<int, int>> pq;
int sum = 0;
for (int i = 0; i < m - 1; i++) {
d[i] = x[i + 1] - x[i];
sum += d[i];
pq.emplace(d[i], i);
}
cerr << sum << endl;
while (n > 1) {
auto p = pq.top();
pq.pop();
sum -= p.first;
n -= 1;
}
cout << sum << endl;
}
| [
"literal.number.change",
"control_flow.loop.condition.change",
"assignment.value.change"
] | 937,251 | 937,252 | u934469795 | cpp |
p03137 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main() {
int n, m;
cin >> n >> m;
if (m <= n) {
cout << 0 << endl;
return 0;
}
vector<int> x(m);
repi(i, m, 0) { cin >> x[i]; }
sort(x.begin(), x.end());
repi(i, m, 1) { x[i - 1] = abs(x[i] - x[i - 1]); }
sort(x.begin(), x.end());
int ans = 0;
repi(i, m - 1 - n + 1, 0) { ans += x[i]; }
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main() {
int n, m;
cin >> n >> m;
if (m <= n) {
cout << 0 << endl;
return 0;
}
vector<int> x(m);
repi(i, m, 0) { cin >> x[i]; }
sort(x.begin(), x.end());
repi(i, m, 1) { x[i - 1] = abs(x[i] - x[i - 1]); }
sort(x.begin(), x.end() - 1);
int ans = 0;
repi(i, m - 1 - n + 1, 0) { ans += x[i]; }
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 937,253 | 937,254 | u187013893 | cpp |
p03137 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main() {
int n, m;
cin >> n >> m;
if (m <= n) {
cout << 0 << endl;
}
vector<int> x(m);
repi(i, m, 0) { cin >> x[i]; }
sort(x.begin(), x.end());
repi(i, m, 1) { x[i - 1] = abs(x[i] - x[i - 1]); }
sort(x.begin(), x.end());
int ans = 0;
repi(i, m - 1 - n + 1, 0) { ans += x[i]; }
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
const long INF = 1e9;
const long MOD = 1e9 + 7;
#define repi(i, n, init) for (int i = init; i < int(n); i++)
int main() {
int n, m;
cin >> n >> m;
if (m <= n) {
cout << 0 << endl;
return 0;
}
vector<int> x(m);
repi(i, m, 0) { cin >> x[i]; }
sort(x.begin(), x.end());
repi(i, m, 1) { x[i - 1] = abs(x[i] - x[i - 1]); }
sort(x.begin(), x.end() - 1);
int ans = 0;
repi(i, m - 1 - n + 1, 0) { ans += x[i]; }
cout << ans << endl;
return 0;
} | [
"control_flow.return.add",
"control_flow.return.0.add",
"expression.operation.binary.add"
] | 937,255 | 937,254 | u187013893 | cpp |
p03137 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define INF 1LL << 60
#define MAX 1000000000
const int MOD = 1000000007;
int main(void) {
int N, M;
ll l;
scanf("%d%d", &N, &M);
if (M == 1) {
puts("0");
return 0;
}
vector<int> X(M), D(M - 1);
rep(i, 0, M) { scanf("%d", &X[i]); }
sort(all(X));
l = X.back() - X.front();
rep(i, 0, M - 1) D[i] = X[i + 1] - X[i];
r_sort(D);
rep(i, 0, N - 1) { l -= D[i]; }
printf("%lld\n", l);
return 0;
}
int gcd(int a, int b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
} /*
int main() {
int N, K;
ll s = 0;
scanf("%d%d", &N, &K);
rep(l, 1, K + 1) {
s += (modpow(K - l + 1,N) - modpow(K - l, N)) % MOD + modpow(K
/ l, N - 1) * (l - 1); printf("%lld %lld \n",s, (modpow(K - l + 1, N) -
modpow(K - l, N)) % MOD, N - 1); s %= MOD;
}
printf("%lld\n", s);
return 0;
}*/ | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define all(_x) _x.begin(), _x.end()
#define r_sort(_x) sort(_x.begin(), _x.end(), std::greater<int>())
#define INF 1LL << 60
#define MAX 1000000000
const int MOD = 1000000007;
int main(void) {
int N, M;
ll l;
scanf("%d%d", &N, &M);
if (M == 1 || N >= M) {
puts("0");
return 0;
}
vector<int> X(M), D(M - 1);
rep(i, 0, M) { scanf("%d", &X[i]); }
sort(all(X));
l = X.back() - X.front();
rep(i, 0, M - 1) D[i] = X[i + 1] - X[i];
r_sort(D);
rep(i, 0, N - 1) { l -= D[i]; }
printf("%lld\n", l);
return 0;
}
int gcd(int a, int b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
} /*
int main() {
int N, K;
ll s = 0;
scanf("%d%d", &N, &K);
rep(l, 1, K + 1) {
s += (modpow(K - l + 1,N) - modpow(K - l, N)) % MOD + modpow(K
/ l, N - 1) * (l - 1); printf("%lld %lld \n",s, (modpow(K - l + 1, N) -
modpow(K - l, N)) % MOD, N - 1); s %= MOD;
}
printf("%lld\n", s);
return 0;
}*/ | [
"control_flow.branch.if.condition.change"
] | 937,281 | 937,282 | u128572736 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
typedef pair<long long, long long> P;
int main() {
int n, m;
cin >> n >> m;
vector<int> v;
vector<int> w;
rep(i, m) {
int x;
cin >> x;
v.push_back(x);
}
int ans = 0;
sort(v.begin(), v.end());
if (n > m) {
cout << 0 << endl;
}
else {
rep(i, m - 1) { w.push_back(v[i + 1] - v[i]); }
sort(w.begin(), w.end());
rep(i, m - n) { ans += w[i]; }
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define repm(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define pb(n) push_back(n)
#define mp make_pair
#define MOD 1002000007
#define INF LONG_LONG_MAX
typedef pair<long long, long long> P;
int main() {
int n, m;
cin >> n >> m;
vector<int> v;
vector<int> w;
rep(i, m) {
int x;
cin >> x;
v.push_back(x);
}
int ans = 0;
sort(v.begin(), v.end());
if (n > m) {
cout << 0 << endl;
}
else {
rep(i, m - 1) { w.push_back(v[i + 1] - v[i]); }
sort(w.begin(), w.end());
rep(i, m - n) { ans += w[i]; }
cout << ans << endl;
}
} | [] | 937,289 | 937,290 | u338193317 | cpp |
p03137 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
int N, M;
int X[100000];
priority_queue<int> dis;
int main() {
cin >> N >> M;
rep(i, M) cin >> X[i];
if (M == 1) {
cout << 0 << endl;
return 0;
}
sort(X, X + M);
int ans = X[M - 1] - X[0];
rep(i, M - 1) { dis.push(X[i + 1] - X[i]); }
rep(i, N - 1) {
ans -= dis.top();
dis.pop();
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
using namespace std;
typedef long long ll;
int N, M;
int X[100000];
priority_queue<int> dis;
int main() {
cin >> N >> M;
rep(i, M) cin >> X[i];
if (N >= M) {
cout << 0 << endl;
return 0;
}
sort(X, X + M);
int ans = X[M - 1] - X[0];
rep(i, M - 1) { dis.push(X[i + 1] - X[i]); }
rep(i, N - 1) {
ans -= dis.top();
dis.pop();
}
cout << ans << endl;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,343 | 937,344 | u731886385 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0;
return 0;
}
vector<int> X(M, 0);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> sa(M - 1, 0);
for (int i = 0; i <= M - 1; i++) {
sa[i] = X[i + 1] - X[i];
}
sort(sa.begin(), sa.end());
int ans = 0;
for (int i = 0; i < M - N; i++) {
ans = ans + sa[i];
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0;
return 0;
}
vector<int> X(M, 0);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> sa(M - 1, 0);
for (int i = 0; i < M - 1; i++) {
sa[i] = X[i + 1] - X[i];
}
sort(sa.begin(), sa.end());
int ans = 0;
for (int i = 0; i < M - N; i++) {
ans = ans + sa[i];
}
cout << ans;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 937,354 | 937,355 | u231455327 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) begin(x), end(x)
#define showall(obj) \
for (auto x : obj) \
cout << x << endl;
typedef long long ll;
typedef pair<int, int> ip;
typedef pair<ll, ll> lp;
typedef vector<int> vint;
typedef vector<ll> vll;
const int inf = 100100100;
const ll INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
vint x(m);
rep(i, m) cin >> x[i];
sort(all(x));
vint l(m - 1);
rep(i, m - 1) { l[i] = x[i + 1] - x[i]; }
sort(all(l));
showall(l);
ll nr = 0;
for (int i = 1; i <= n - 1; ++i) {
nr += l[m - i - 1];
}
cout << x[m - 1] - x[0] - nr << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) begin(x), end(x)
#define showall(obj) \
for (auto x : obj) \
cout << x << endl;
typedef long long ll;
typedef pair<int, int> ip;
typedef pair<ll, ll> lp;
typedef vector<int> vint;
typedef vector<ll> vll;
const int inf = 100100100;
const ll INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
vint x(m);
rep(i, m) cin >> x[i];
sort(all(x));
vint l(m - 1);
rep(i, m - 1) { l[i] = x[i + 1] - x[i]; }
sort(all(l));
ll nr = 0;
for (int i = 1; i <= n - 1; ++i) {
nr += l[m - i - 1];
}
cout << x[m - 1] - x[0] - nr << endl;
return 0;
}
| [
"call.remove"
] | 937,370 | 937,371 | u190761897 | cpp |
p03137 | #include <float.h>
#include <limits.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m;
int *x, *x_diff;
int sum = 0;
scanf("%d%d\n", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
x = (int *)malloc(sizeof(int) * m);
x_diff = (int *)malloc(sizeof(int) * (m - 1));
for (int i = 0; i < n; i++) {
scanf("%d", &x[i]);
}
qsort(x, m, sizeof(int), asc);
for (int i = 0; i < m - 1; i++) {
x_diff[i] = x[i + 1] - x[i];
}
qsort(x_diff, m - 1, sizeof(int), asc);
for (int i = 0; i < m - n; i++) {
sum += x_diff[i];
}
printf("%d", sum);
free(x);
free(x_diff);
return 0;
}
| #include <float.h>
#include <limits.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
int n, m;
int *x, *x_diff;
int sum = 0;
scanf("%d%d\n", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
x = (int *)malloc(sizeof(int) * m);
x_diff = (int *)malloc(sizeof(int) * (m - 1));
for (int i = 0; i < m; i++) {
scanf("%d", &x[i]);
}
qsort(x, m, sizeof(int), asc);
for (int i = 0; i < m - 1; i++) {
x_diff[i] = x[i + 1] - x[i];
}
qsort(x_diff, m - 1, sizeof(int), asc);
for (int i = 0; i < m - n; i++) {
sum += x_diff[i];
}
printf("%d", sum);
free(x);
free(x_diff);
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 937,377 | 937,378 | u870205469 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> PLL;
typedef pair<P, P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P, VECP, greater<P>> PQP;
typedef priority_queue<ll, VECLL, greater<ll>> PQll;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
#define index_check(i, n) \
if (i > n - 1 || i < 0) \
continue;
#define LINF (ll)1e18
#define INF (int)1e9
#define fs first
#define sc second
int main() {
ll n, m;
cin >> n >> m;
ll a[m] = {};
if (m == 1) {
cout << 0 << endl;
return 0;
}
rep(i, 0, m) { cin >> a[i]; }
sort(a, a + m);
ll b[m - 1] = {};
ll ans = 0;
rep(i, 0, m - 1) {
b[i] = a[i + 1] - a[i];
ans += b[i];
}
sort(b, b + m - 1, greater<ll>());
rep(i, 0, n - 1) { ans -= b[i]; }
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> PLL;
typedef pair<P, P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P, VECP, greater<P>> PQP;
typedef priority_queue<ll, VECLL, greater<ll>> PQll;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
#define index_check(i, n) \
if (i > n - 1 || i < 0) \
continue;
#define LINF (ll)1e18
#define INF (int)1e9
#define fs first
#define sc second
int main() {
ll n, m;
cin >> n >> m;
ll a[m] = {};
if (m == 1 || n >= m) {
cout << 0 << endl;
return 0;
}
rep(i, 0, m) { cin >> a[i]; }
sort(a, a + m);
ll b[m - 1] = {};
ll ans = 0;
rep(i, 0, m - 1) {
b[i] = a[i + 1] - a[i];
ans += b[i];
}
sort(b, b + m - 1, greater<ll>());
rep(i, 0, n - 1) { ans -= b[i]; }
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 937,396 | 937,397 | u129134470 | cpp |
p03137 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
signed main() {
ll n, m, sum = 0;
cin >> n >> m;
ll x[m];
rep(i, 0, m) cin >> x[i];
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x, x + m, greater<ll>());
ll d[m - 1] = {};
rep(i, 1, m) {
d[i - 1] = x[i - 1] - x[i];
sum += d[i - 1];
// cout << d[i-1] << " " << sum << endl;
}
sort(d, d + m - 1, greater<ll>());
rep(i, 0, n - 1) { sum -= d[i]; }
cout << sum << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pll;
typedef pair<P, P> PP;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define LINF (ll)1e17
#define INF 1e9
#define MOD 1e9 + 7
#define sMOD 1e5
#define fs first
#define sc second
signed main() {
ll n, m, sum = 0;
cin >> n >> m;
ll x[m];
rep(i, 0, m) cin >> x[i];
if (m == 1 || n >= m) {
cout << 0 << endl;
return 0;
}
sort(x, x + m, greater<ll>());
ll d[m - 1] = {};
rep(i, 1, m) {
d[i - 1] = x[i - 1] - x[i];
sum += d[i - 1];
// cout << d[i-1] << " " << sum << endl;
}
sort(d, d + m - 1, greater<ll>());
rep(i, 0, n - 1) { sum -= d[i]; }
cout << sum << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 937,398 | 937,399 | u129134470 | cpp |
p03137 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
} else {
int a[m];
rep(i, m) cin >> a[i];
sort(a, a + m);
int b[m - 1];
rep(i, m - 1) b[i] = a[i + 1] - a[i];
sort(b, b + m - 1, greater<int>());
int ans_sub = 0;
rep(i, n - 2) ans_sub += b[i];
cout << a[n - 1] - a[0] - ans_sub << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
} else {
int a[m];
rep(i, m) cin >> a[i];
sort(a, a + m);
int b[m - 1];
rep(i, m - 1) b[i] = a[i + 1] - a[i];
sort(b, b + m - 1, greater<int>());
int ans_sub = 0;
rep(i, n - 1) ans_sub += b[i];
cout << a[m - 1] - a[0] - ans_sub << endl;
}
return 0;
} | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 937,425 | 937,426 | u933962236 | cpp |
p03137 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
int a[m];
rep(i, m) cin >> a[i];
sort(a, a + m);
int b[m - 1];
rep(i, m - 1) b[i] = a[i + 1] - a[i];
sort(b, b + m - 1, greater<int>());
int ans_sub = 0;
rep(i, n - 2) ans_sub += b[i];
cout << a[n - 1] - a[0] - ans_sub << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
} else {
int a[m];
rep(i, m) cin >> a[i];
sort(a, a + m);
int b[m - 1];
rep(i, m - 1) b[i] = a[i + 1] - a[i];
sort(b, b + m - 1, greater<int>());
int ans_sub = 0;
rep(i, n - 1) ans_sub += b[i];
cout << a[m - 1] - a[0] - ans_sub << endl;
}
return 0;
} | [
"control_flow.branch.else.add",
"literal.number.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 937,427 | 937,426 | u933962236 | cpp |
p03137 | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
void solve() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0;
return;
}
vector<int> x(m);
for (int i = 0; i < m; ++i) {
cin >> x[i];
}
sort(x.begin(), x.end());
vector<int> diff(m - 1);
for (int i = 0; i < m - 1; ++i) {
diff[i] = x[i + 1] - x[i];
}
sort(diff.begin(), diff.end());
cout << accumulate(diff.begin(), next(diff.begin(), n + 1), 0);
}
int main() {
fastio;
solve();
return 0;
} | #include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL; // = 10^9 + 7
const double PI = 3.14159265358979;
void solve() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0;
return;
}
vector<ll> x(m);
for (int i = 0; i < m; ++i) {
cin >> x[i];
}
sort(x.begin(), x.end());
vector<ll> diff(m - 1);
for (int i = 0; i < m - 1; ++i) {
diff[i] = x[i + 1] - x[i];
}
sort(diff.begin(), diff.end());
cout << accumulate(diff.begin(), next(diff.begin(), m - n), 0);
}
int main() {
fastio;
solve();
return 0;
} | [
"expression.operation.binary.remove"
] | 937,438 | 937,439 | u866535689 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (m == 1) {
cout << "0";
return 0;
}
vector<long long> x(m), a(m - 1);
for (long long i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
for (long long i = m - 2; i >= 0; i--) {
a[i] = x[i + 1] - x[i];
}
sort(a.begin(), a.end());
int64_t ans = x[m - 1] - x[0];
for (long long i = 0; i < n - 1; i++) {
ans -= a[m - 2 - i];
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (n >= m) {
cout << "0";
return 0;
}
vector<long long> x(m), a(m - 1);
for (long long i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
for (long long i = m - 2; i >= 0; i--) {
a[i] = x[i + 1] - x[i];
}
sort(a.begin(), a.end());
int64_t ans = x[m - 1] - x[0];
for (long long i = 0; i < n - 1; i++) {
ans -= a[m - 2 - i];
}
cout << ans;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,450 | 937,451 | u367569703 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1 || m >= n) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<pair<int, int>> dist;
for (int i = 0; i < m; i++) {
cin >> x.at(i);
x.at(i) += 100000;
}
sort(x.begin(), x.end());
for (int i = 1; i < m; i++) {
int dif = x.at(i) - x.at(i - 1);
dist.push_back(make_pair(dif, i));
}
sort(dist.begin(), dist.end());
reverse(dist.begin(), dist.end());
vector<int> koma(n);
koma[0] = -1;
for (int i = 0; i < n - 1; i++) {
koma[i + 1] = dist[i].second - 1;
}
sort(koma.begin(), koma.end());
int ans = 0;
for (int i = 1; i < n; i++) {
ans += x[koma[i]] - x[koma[i - 1] + 1];
}
ans += x[m - 1] - x[koma[n - 1] + 1];
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1 || n >= m) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<pair<int, int>> dist;
for (int i = 0; i < m; i++) {
cin >> x.at(i);
x.at(i) += 100000;
}
sort(x.begin(), x.end());
for (int i = 1; i < m; i++) {
int dif = x.at(i) - x.at(i - 1);
dist.push_back(make_pair(dif, i));
}
sort(dist.begin(), dist.end());
reverse(dist.begin(), dist.end());
vector<int> koma(n);
koma[0] = -1;
for (int i = 0; i < n - 1; i++) {
koma[i + 1] = dist[i].second - 1;
}
sort(koma.begin(), koma.end());
int ans = 0;
for (int i = 1; i < n; i++) {
ans += x[koma[i]] - x[koma[i - 1] + 1];
}
ans += x[m - 1] - x[koma[n - 1] + 1];
cout << ans << endl;
}
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 937,463 | 937,464 | u191114518 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<pair<int, int>> dist;
for (int i = 0; i < m; i++) {
cin >> x.at(i);
x.at(i) += 100000;
}
sort(x.begin(), x.end());
for (int i = 1; i < m; i++) {
int dif = x.at(i) - x.at(i - 1);
dist.push_back(make_pair(dif, i));
}
sort(dist.begin(), dist.end());
reverse(dist.begin(), dist.end());
vector<int> koma(n);
koma[0] = -1;
for (int i = 0; i < n - 1; i++) {
koma[i + 1] = dist[i].second - 1;
}
sort(koma.begin(), koma.end());
int ans = 0;
for (int i = 1; i < n; i++) {
ans += x[koma[i]] - x[koma[i - 1] + 1];
}
ans += x[m - 1] - x[koma[n - 1] + 1];
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1 || n >= m) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<pair<int, int>> dist;
for (int i = 0; i < m; i++) {
cin >> x.at(i);
x.at(i) += 100000;
}
sort(x.begin(), x.end());
for (int i = 1; i < m; i++) {
int dif = x.at(i) - x.at(i - 1);
dist.push_back(make_pair(dif, i));
}
sort(dist.begin(), dist.end());
reverse(dist.begin(), dist.end());
vector<int> koma(n);
koma[0] = -1;
for (int i = 0; i < n - 1; i++) {
koma[i + 1] = dist[i].second - 1;
}
sort(koma.begin(), koma.end());
int ans = 0;
for (int i = 1; i < n; i++) {
ans += x[koma[i]] - x[koma[i - 1] + 1];
}
ans += x[m - 1] - x[koma[n - 1] + 1];
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 937,465 | 937,464 | u191114518 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
cout << 0;
int a[m];
for (int i = 0; i < m; i++)
cin >> a[i];
sort(a, a + m);
int d[m - 1];
for (int i = 0; i < m - 1; i++)
d[i] = a[i + 1] - a[i];
sort(d, d + m - 1);
int t = 0;
for (int i = 0; i < m - n; i++)
t += d[i];
cout << t;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
cout << 0;
else {
int a[m];
for (int i = 0; i < m; i++)
cin >> a[i];
sort(a, a + m);
int d[m - 1];
for (int i = 0; i < m - 1; i++)
d[i] = a[i + 1] - a[i];
sort(d, d + m - 1);
int t = 0;
for (int i = 0; i < m - n; i++)
t += d[i];
cout << t;
}
return 0;
}
| [
"control_flow.branch.else.add"
] | 937,476 | 937,477 | u458748702 | cpp |
p03137 | #include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
if (n >= m) {
printf("%d", 0);
return 0;
}
vector<int> viCoordinate(m);
for (int i = 0; i < m; i++) {
scanf("%d", &viCoordinate[i]);
}
sort(viCoordinate.begin(), viCoordinate.end());
int nAns = viCoordinate[m - 1] - viCoordinate[0];
vector<int> viDist;
for (int i = 0; i < m - 1; i++) {
int iDist = viCoordinate[i + 1] - viCoordinate[i];
viDist.push_back(iDist);
}
sort(viDist.begin(), viDist.end());
for (int i = m - 2; i < m - n + 1; i++) {
nAns -= viDist[i];
}
printf("%d", nAns);
return 0;
}
| #include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
if (n >= m) {
printf("%d", 0);
return 0;
}
vector<int> viCoordinate(m);
for (int i = 0; i < m; i++) {
scanf("%d", &viCoordinate[i]);
}
sort(viCoordinate.begin(), viCoordinate.end());
int nAns = viCoordinate[m - 1] - viCoordinate[0];
vector<int> viDist;
for (int i = 0; i < m - 1; i++) {
int iDist = viCoordinate[i + 1] - viCoordinate[i];
viDist.push_back(iDist);
}
sort(viDist.begin(), viDist.end());
for (int i = m - 2; i > m - n - 1; i--) {
nAns -= viDist[i];
}
printf("%d", nAns);
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operator.arithmetic.change"
] | 937,480 | 937,481 | u865858945 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << "0" << endl;
} else {
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X.at(i);
}
sort(X.begin(), X.end());
int a = X.at(M - 1) - X.at(0);
vector<int> Y(M - 1);
Y.at(0) = 0;
for (int i = 0; i < M - 1; i++) {
Y.at(i) = X.at(i + 1) - X.at(i);
}
sort(Y.begin(), Y.end());
reverse(Y.begin(), Y.end());
int b = 0;
for (int i = 0; i < N - 1; i++) {
b = b + Y.at(i);
}
cout << a - b << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << "0" << endl;
} else {
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X.at(i);
}
sort(X.begin(), X.end());
int a = X.at(M - 1) - X.at(0);
vector<int> Y(M - 1);
Y.at(0) = 0;
for (int i = 0; i < M - 1; i++) {
Y.at(i) = X.at(i + 1) - X.at(i);
}
sort(Y.begin(), Y.end());
reverse(Y.begin(), Y.end());
int b = 0;
for (int i = 0; i < N - 1; i++) {
b = b + Y.at(i);
}
cout << a - b << endl;
}
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,492 | 937,493 | u442097733 | cpp |
p03137 | #include <stdio.h>
int main(void) {
int n, m, x, f[200001] = {}, i, j, min = 200000, max = 0, k, t = 0, l,
dt[100000], ans = 0;
scanf("%d%d", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
for (i = 0; i < m; i++) {
scanf("%d", &x);
f[x + 100000] = 1;
if (x + 100000 < min)
min = x + 100000;
if (x + 100000 > max)
max = x + 100000;
}
k = min;
for (i = min + 1; i <= max; i++) {
if (f[i]) {
dt[t] = i - k;
ans += dt[t];
k = i;
t++;
}
}
if (n * 2 < m) {
for (i = 0; i < n - 1; i++) {
max = 0;
for (j = 0; j < t; j++) {
if (dt[j] > max) {
max = dt[j];
l = j;
}
}
ans -= max;
dt[l] = 0;
}
} else {
ans = 0;
for (i = 0; i < t - n + 2; i++) {
min = 2000000;
for (j = 0; j < t; j++) {
if (dt[j] < min) {
min = dt[j];
l = j;
}
}
ans += min;
dt[l] = 2000000;
}
}
printf("%d\n", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int n, m, x, f[200001] = {}, i, j, min = 200000, max = 0, k, t = 0, l,
dt[100000], ans = 0;
scanf("%d%d", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
for (i = 0; i < m; i++) {
scanf("%d", &x);
f[x + 100000] = 1;
if (x + 100000 < min)
min = x + 100000;
if (x + 100000 > max)
max = x + 100000;
}
k = min;
for (i = min + 1; i <= max; i++) {
if (f[i]) {
dt[t] = i - k;
ans += dt[t];
k = i;
t++;
}
}
if (n * 2 < m) {
for (i = 0; i < n - 1; i++) {
max = 0;
for (j = 0; j < t; j++) {
if (dt[j] > max) {
max = dt[j];
l = j;
}
}
ans -= max;
dt[l] = 0;
}
} else {
ans = 0;
for (i = 0; i < t - n + 1; i++) {
min = 2000000;
for (j = 0; j < t; j++) {
if (dt[j] < min) {
min = dt[j];
l = j;
}
}
ans += min;
dt[l] = 2000000;
}
}
printf("%d\n", ans);
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 937,494 | 937,495 | u088895504 | cpp |
p03137 | #include <stdio.h>
int main(void) {
int n, m, x, f[200001] = {}, i, j, min = 200000, max = 0, k, t = 0, l,
dt[100000], ans = 0;
scanf("%d%d", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
for (i = 0; i < m; i++) {
scanf("%d", &x);
f[x + 100000] = 1;
if (x + 100000 < min)
min = x + 100000;
if (x + 100000 > max)
max = x + 100000;
}
k = min;
for (i = min + 1; i <= max; i++) {
if (f[i]) {
dt[t] = i - k;
ans += dt[t];
k = i;
t++;
}
}
if (n * 2 < m) {
for (i = 0; i < n - 1; i++) {
max = 0;
for (j = 0; j < t; j++) {
if (dt[j] > max) {
max = dt[j];
l = j;
}
}
ans -= max;
dt[l] = 0;
}
} else {
ans = 0;
for (i = 0; i < t - n + 2; i++) {
for (j = 0; j < t; j++) {
if (dt[j] < min) {
min = dt[j];
l = j;
}
}
ans += min;
dt[l] = 2000000;
}
}
printf("%d\n", ans);
return 0;
} | #include <stdio.h>
int main(void) {
int n, m, x, f[200001] = {}, i, j, min = 200000, max = 0, k, t = 0, l,
dt[100000], ans = 0;
scanf("%d%d", &n, &m);
if (n >= m) {
printf("0\n");
return 0;
}
for (i = 0; i < m; i++) {
scanf("%d", &x);
f[x + 100000] = 1;
if (x + 100000 < min)
min = x + 100000;
if (x + 100000 > max)
max = x + 100000;
}
k = min;
for (i = min + 1; i <= max; i++) {
if (f[i]) {
dt[t] = i - k;
ans += dt[t];
k = i;
t++;
}
}
if (n * 2 < m) {
for (i = 0; i < n - 1; i++) {
max = 0;
for (j = 0; j < t; j++) {
if (dt[j] > max) {
max = dt[j];
l = j;
}
}
ans -= max;
dt[l] = 0;
}
} else {
ans = 0;
for (i = 0; i < t - n + 1; i++) {
min = 2000000;
for (j = 0; j < t; j++) {
if (dt[j] < min) {
min = dt[j];
l = j;
}
}
ans += min;
dt[l] = 2000000;
}
}
printf("%d\n", ans);
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.add"
] | 937,496 | 937,495 | u088895504 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[4] = {1, 0, -1, 0};
const ll dx[4] = {0, -1, 0, 1};
long long fac(ll a) {
long long ans = 1;
while (a > 1) {
ans *= a;
ans %= 1000000007;
a--;
}
return ans;
}
int main() {
ll n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
}
vl v(m), ans(m - 1);
rep(i, m) cin >> v[i];
sort(all(v));
rep(i, m - 1) ans[i] = v[i + 1] - v[i];
sort(all(ans));
ll count = 0;
for (int i = 0; i < m - n; i++) {
count += ans[i];
}
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[4] = {1, 0, -1, 0};
const ll dx[4] = {0, -1, 0, 1};
long long fac(ll a) {
long long ans = 1;
while (a > 1) {
ans *= a;
ans %= 1000000007;
a--;
}
return ans;
}
int main() {
ll n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
vl v(m), ans(m - 1);
rep(i, m) cin >> v[i];
sort(all(v));
rep(i, m - 1) ans[i] = v[i + 1] - v[i];
sort(all(ans));
ll count = 0;
for (ll i = 0; i < m - n; i++) {
count += ans[i];
}
cout << count << endl;
}
| [
"control_flow.return.add",
"control_flow.return.0.add",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 937,497 | 937,498 | u160429264 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(m);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i++)
diff.push_back(abs(arr[i] - arr[i - 1]));
sort(diff.begin(), diff.end());
for (int i = 0; i < n + 1; i++)
ans += diff[i];
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(m);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i++)
diff.push_back(abs(arr[i] - arr[i - 1]));
sort(diff.begin(), diff.end());
for (int i = 0; i < m - n; i++)
ans += diff[i];
cout << ans;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 937,499 | 937,500 | u901813121 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(m);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i++)
diff.push_back(arr[i] - arr[i - 1]);
sort(diff.begin(), diff.end());
for (int i = 0; i < n; i++)
ans += diff[i];
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(m);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i++)
diff.push_back(abs(arr[i] - arr[i - 1]));
sort(diff.begin(), diff.end());
for (int i = 0; i < m - n; i++)
ans += diff[i];
cout << ans;
}
| [
"call.arguments.add",
"call.arguments.change",
"control_flow.loop.for.condition.change"
] | 937,501 | 937,500 | u901813121 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(n);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i++)
diff.push_back(arr[i] - arr[i - 1]);
sort(diff.begin(), diff.end());
for (int i = 0; i < n; i++)
ans += diff[i];
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n, m;
cin >> n >> m;
if (n >= m)
return cout << 0, 0;
vector<int> arr(m);
int ans = 0;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> diff;
for (int i = 1; i < m; i++)
diff.push_back(abs(arr[i] - arr[i - 1]));
sort(diff.begin(), diff.end());
for (int i = 0; i < m - n; i++)
ans += diff[i];
cout << ans;
}
| [
"call.add",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.add"
] | 937,502 | 937,500 | u901813121 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, m;
cin >> n >> m;
if (m == 1) { // m==1のとき
cout << 0 << endl;
return 0;
}
vector<int> x(m);
rep(i, m) { cin >> x.at(i); }
sort(x.begin(), x.end());
vector<int> d(m - 1);
rep(i, m - 1) { d.at(i) = x.at(i + 1) - x.at(i); }
sort(d.begin(), d.end());
int res = x.at(m - 1) - x.at(0);
rep(i, n - 1) { res -= d.at(m - i - 2); }
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, m;
cin >> n >> m;
if (n >= m) { // n>=mのとき０
cout << 0 << endl;
return 0;
}
vector<int> x(m);
rep(i, m) { cin >> x.at(i); }
sort(x.begin(), x.end());
vector<int> d(m - 1);
rep(i, m - 1) { d.at(i) = x.at(i + 1) - x.at(i); }
sort(d.begin(), d.end());
int res = x.at(m - 1) - x.at(0);
rep(i, n - 1) { res -= d.at(m - i - 2); }
cout << res << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,517 | 937,518 | u690475097 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, cnt = 0;
cin >> n >> m;
if (n >= m)
cout << 0 << endl;
else {
int x[m];
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x, x + m);
int b[m - 1];
for (int i = 0; i < m - 1; i++)
b[i] = x[i + 1] - x[i];
sort(b, b + m - 1);
for (int i = 0; i <= n; i++)
cnt += b[i];
cout << cnt << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, cnt = 0;
cin >> n >> m;
if (n >= m)
cout << 0 << endl;
else {
int x[m];
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x, x + m);
int b[m - 1];
for (int i = 0; i < m - 1; i++)
b[i] = x[i + 1] - x[i];
sort(b, b + m - 1);
for (int i = 0; i < m - n; i++)
cnt += b[i];
cout << cnt << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 937,533 | 937,534 | u298768617 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
} else {
vector<int> vec(M);
for (int i = 0; i < M; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
vector<int> dist(M - 1);
for (int i = 0; i < M - 1; i++) {
dist.at(i) = vec.at(i + 1) - vec.at(i - 1);
}
sort(dist.begin(), dist.end());
int ans = 0;
for (int i = 0; i < M - 1 - (N - 1); i++) {
ans += dist.at(i);
}
cout << ans << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
} else {
vector<int> vec(M);
for (int i = 0; i < M; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
vector<int> dist(M - 1);
for (int i = 0; i < M - 1; i++) {
dist.at(i) = vec.at(i + 1) - vec.at(i);
}
sort(dist.begin(), dist.end());
int ans = 0;
for (int i = 0; i < M - 1 - (N - 1); i++) {
ans += dist.at(i);
}
cout << ans << endl;
}
} | [
"expression.operation.binary.remove"
] | 937,572 | 937,573 | u681084651 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << "0"
<< "\n";
return 0;
}
vector<int> v(M);
for (int i = 0; i < M; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
vector<int> sa(M - 1);
for (int i = 1; i < M; i++) {
sa.at(i - 1) = v.at(i) - v.at(i - 1);
}
sort(sa.begin(), sa.end());
reverse(sa.begin(), sa.end());
int soukyori = v.at(M - 1) - v.at(0);
int yaranai = 0;
for (int i = 0; i < N - 1; i++) {
yaranai += sa.at(i);
}
cout << soukyori - yaranai << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, M;
cin >> N >> M;
if (M == 1 || N >= M) {
cout << "0"
<< "\n";
return 0;
}
vector<int> v(M);
for (int i = 0; i < M; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
vector<int> sa(M - 1);
for (int i = 1; i < M; i++) {
sa.at(i - 1) = v.at(i) - v.at(i - 1);
}
sort(sa.begin(), sa.end());
reverse(sa.begin(), sa.end());
int soukyori = v.at(M - 1) - v.at(0);
int yaranai = 0;
for (int i = 0; i < N - 1; i++) {
yaranai += sa.at(i);
}
cout << soukyori - yaranai << "\n";
} | [
"control_flow.branch.if.condition.change"
] | 937,593 | 937,594 | u086063386 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, m;
cin >> n >> m;
ll a[n];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
if (m <= n) {
// cout<<"if"<<endl;
cout << 0 << endl;
} else {
sort(a, a + m);
vector<ll> v;
for (int i = 1; i < m; i++) {
v.push_back(abs(a[i] - a[i - 1]));
}
sort(v.begin(), v.end(), greater<ll>());
for (int i = 0; i < n - 1; i++) {
v[i] = 0;
}
/*for(int i=0;i<v.size();i++)
{
cout<<v[i]<<" ";
}
cout<<endl<<endl;;
*/
ll sum = 0;
for (int i = 0; i < v.size(); i++) {
sum += v[i];
}
cout << sum << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll n, m;
cin >> n >> m;
ll a[m];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
if (m <= n) {
// cout<<"if"<<endl;
cout << 0 << endl;
} else {
sort(a, a + m);
vector<ll> v;
for (int i = 1; i < m; i++) {
v.push_back(abs(a[i] - a[i - 1]));
}
sort(v.begin(), v.end(), greater<ll>());
for (int i = 0; i < n - 1; i++) {
v[i] = 0;
}
/*for(int i=0;i<v.size();i++)
{
cout<<v[i]<<" ";
}
cout<<endl<<endl;;
*/
ll sum = 0;
for (int i = 0; i < v.size(); i++) {
sum += v[i];
}
cout << sum << endl;
}
} | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 937,605 | 937,606 | u159663513 | cpp |
p03137 | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define inf (1ll << 60)
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
signed gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
signed lcm(int a, int b) { return a * b / gcd(a, b); }
using namespace std;
const int mod = 1e9 + 7;
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
}
signed main() {
init();
run();
return 0;
}
void run() {
int n, m;
cin >> n >> m;
if (m == 1) {
cout << 0 << endl;
return;
}
vi x(m);
rep(i, m) cin >> x[i];
RSORT(x);
int ans = x[0] - x[m - 1];
vi sa(m - 1);
rep(i, m - 1) { sa[i] = x[i] - x[i + 1]; }
RSORT(sa);
int sum_sa = 0;
rep(i, n - 1) { sum_sa += sa[i]; }
cout << ans - sum_sa << endl;
} | #pragma GCC optimize "-O3"
#pragma GCC target("avx")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; ++i)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define pi pair<int, int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define inf (1ll << 60)
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())
signed gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
signed lcm(int a, int b) { return a * b / gcd(a, b); }
using namespace std;
const int mod = 1e9 + 7;
void run();
void init() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
}
signed main() {
init();
run();
return 0;
}
void run() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return;
}
vi x(m);
rep(i, m) cin >> x[i];
RSORT(x);
int ans = x[0] - x[m - 1];
vi sa(m - 1);
rep(i, m - 1) { sa[i] = x[i] - x[i + 1]; }
RSORT(sa);
int sum_sa = 0;
rep(i, n - 1) { sum_sa += sa[i]; }
cout << ans - sum_sa << endl;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,696 | 937,697 | u775507068 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, m, ans;
cin >> n >> m;
if (n >= m) {
cout << 0;
return 0;
}
vector<int> x(m), sa(m, 0);
for (i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
for (i = 1; i < m; i++)
sa[i] = x[i] - x[i - 1];
sort(sa.begin(), sa.end(), greater<int>());
ans = x[m - 1] - x[0];
for (i = 0; i < m - n; i++)
ans -= sa[i];
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, m, ans;
cin >> n >> m;
if (n >= m) {
cout << 0;
return 0;
}
vector<int> x(m), sa(m, 0);
for (i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
for (i = 1; i < m; i++)
sa[i] = x[i] - x[i - 1];
sort(sa.begin(), sa.end(), greater<int>());
ans = x[m - 1] - x[0];
for (i = 0; i < n - 1; i++)
ans -= sa[i];
cout << ans;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 937,707 | 937,708 | u251847465 | cpp |
p03137 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
bool prime(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd(long long a, long long b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
class UnionFind {
public:
//各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
vector<int> Parent;
//クラスを作るときは、Parentの値を全て-1にする。
//以下のようにすると全てバラバラの頂点として解釈できる。
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //先祖をrootで取っておきたい。
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらAとBをひっくり返す。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
vector<int> x(m);
REP(i, m) { cin >> x[i]; }
sort(x.begin(), x.end());
int ans = x[m - 1] - x[0];
vector<int> diff(m - 1);
REP(i, m - 1) { diff[i] = x[i + 1] - x[i]; }
sort(diff.begin(), diff.end(), greater<int>());
REP(i, n) { ans -= diff[i]; }
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
using namespace std;
bool prime(int n) {
if (n == 1) {
return false;
} else if (n == 2) {
return true;
} else {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
}
long long gcd(long long a, long long b) {
if (a < b) {
swap(a, b);
}
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
class UnionFind {
public:
//各頂点の親の番号を格納する。その頂点自身が親だった場合は-(その集合のサイズ)を入れる。
vector<int> Parent;
//クラスを作るときは、Parentの値を全て-1にする。
//以下のようにすると全てバラバラの頂点として解釈できる。
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
//自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; //先祖をrootで取っておきたい。
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
//すでにくっついてるからくっ付けない
return false;
}
//大きい方(A)に小さいほう(B)をくっ付けたい
//大小が逆だったらAとBをひっくり返す。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
vector<int> x(m);
REP(i, m) { cin >> x[i]; }
sort(x.begin(), x.end());
int ans = x[m - 1] - x[0];
vector<int> diff(m - 1);
REP(i, m - 1) { diff[i] = x[i + 1] - x[i]; }
sort(diff.begin(), diff.end(), greater<int>());
REP(i, n - 1) { ans -= diff[i]; }
cout << ans << endl;
return 0;
}
| [
"expression.operation.binary.add"
] | 937,715 | 937,716 | u222293734 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<long> X;
cin >> N >> M;
for (int i = 0; i < M; i++) {
long x;
cin >> x;
X.push_back(x);
}
sort(X.begin(), X.end());
vector<long> ivl;
for (int i = 0; i < M - 1; i++) {
ivl.push_back(X[i + 1] - X[i]);
}
sort(ivl.begin(), ivl.end(), greater<long>());
if (M == 1) {
cout << "0" << endl;
return 0;
}
long ans = 0;
for (int i = 0; i < N - 1; i++) {
ans += ivl[i];
}
cout << X[M - 1] - X[0] - ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<long> X;
cin >> N >> M;
for (int i = 0; i < M; i++) {
long x;
cin >> x;
X.push_back(x);
}
sort(X.begin(), X.end());
vector<long> ivl;
for (int i = 0; i < M - 1; i++) {
ivl.push_back(X[i + 1] - X[i]);
}
sort(ivl.begin(), ivl.end(), greater<long>());
if (N >= M) {
cout << "0" << endl;
return 0;
}
long ans = 0;
for (int i = 0; i < N - 1; i++) {
ans += ivl[i];
}
cout << X[M - 1] - X[0] - ans << endl;
return 0;
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,778 | 937,779 | u522200796 | cpp |
p03137 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
if (m == 1) {
cout << 0 << endl;
return 0;
}
priority_queue<int> xs;
rep(i, m) {
int x;
cin >> x;
xs.push(x);
}
priority_queue<int> q;
int max = xs.top();
int before = xs.top();
int after;
xs.pop();
rep(i, m - 1) {
after = xs.top();
q.push(abs(before - after) - 1);
before = after;
xs.pop();
}
int d = abs(max - after);
rep(i, n - 1) {
if (q.empty())
break;
d -= q.top();
q.pop();
}
cout << (d - n + 1) << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
if (m == 1 || n >= m) {
cout << 0 << endl;
return 0;
}
priority_queue<int> xs;
rep(i, m) {
int x;
cin >> x;
xs.push(x);
}
priority_queue<int> q;
int max = xs.top();
int before = xs.top();
int after;
xs.pop();
rep(i, m - 1) {
after = xs.top();
q.push(abs(before - after) - 1);
before = after;
xs.pop();
}
int d = abs(max - after);
rep(i, n - 1) {
if (q.empty())
break;
d -= q.top();
q.pop();
}
cout << (d - n + 1) << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 937,806 | 937,807 | u783674761 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m, x[100009];
long long int sm = 0;
vector<long long> v1, v2;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x[i];
v1.push_back(x[i]);
}
if (m == 1) {
cout << 0 << endl;
} else {
sort(v1.begin(), v1.end());
for (int i = 1; i < m; i++) {
v2.push_back(v1[i] - v1[i - 1]);
sm += v1[i] - v1[i - 1];
}
sort(v2.begin(), v2.end(), greater<long long>());
for (int i = 0; i < n - 1; i++) {
sm -= v2[i];
}
cout << sm << endl;
}
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m, x[100009];
long long int sm = 0;
vector<long long> v1, v2;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x[i];
v1.push_back(x[i]);
}
if (n >= m) {
cout << 0 << endl;
} else {
sort(v1.begin(), v1.end());
for (int i = 1; i < m; i++) {
v2.push_back(v1[i] - v1[i - 1]);
sm += v1[i] - v1[i - 1];
}
sort(v2.begin(), v2.end(), greater<long long>());
for (int i = 0; i < n - 1; i++) {
sm -= v2[i];
}
cout << sm << endl;
}
} | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 937,812 | 937,813 | u112318601 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
if (M <= N) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; ++i) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> L(M - 1);
for (int i = 0; i < M; ++i) {
L[i] = X[i + 1] - X[i];
}
sort(L.begin(), L.end());
ll ans = 0;
for (int i = 0; i < M - N; ++i) {
ans += L[i];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
if (M <= N) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; ++i) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> L(M - 1);
for (int i = 0; i < M - 1; ++i) {
L[i] = X[i + 1] - X[i];
}
sort(L.begin(), L.end());
ll ans = 0;
for (int i = 0; i < M - N; ++i) {
ans += L[i];
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 937,816 | 937,817 | u774160580 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n > m) {
cout << 0 << endl;
} else {
vector<int> x(m, 0);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
x[i] = x[i + 1] - x[i];
}
x.erase(x.end() - 1);
sort(x.begin(), x.end());
for (int i = 1; i < m - n; i++) {
x[0] += x[i];
}
cout << x[0] << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
} else {
vector<int> x(m, 0);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
x[i] = x[i + 1] - x[i];
}
x.erase(x.end() - 1);
sort(x.begin(), x.end());
for (int i = 1; i < m - n; i++) {
x[0] += x[i];
}
cout << x[0] << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 937,820 | 937,821 | u188117876 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#define REPIT_R(it, container) \
for (auto it = container.rbegin(); it != container.rend(); it++)
// input
#define cin1(x) cin >> x
#define cin2(x, y) cin >> x >> y
#define cin3(x, y, z) cin >> x >> y >> z
#define ncin1(n, x) \
REP(i, 0, n) { cin1(x[i]); }
#define ncin2(n, x, y) \
REP(i, 0, n) { cin2(x[i], y[i]); }
#define ncin3(n, x, y, z) \
REP(i, 0, n) { cin3(x[i], y[i], z[i]); }
// output
#define cout1(x) cout << #x << ": " << x << endl;
#define cout2(x, y) cout << #x << ": " << x << ", " << #y << ": " << y << endl;
#define cout3(x, y, z) \
cout << #x << ": " << x << ", " << #y << ": " << y << ", " << #z << ": " \
<< z << endl; \
;
#define ncout1(n, x) \
REP(i, 0, n) { cout << #x << "[" << i << "]: " << x[i] << endl; }
#define coutp(p) \
cout << #p << ":" \
<< " (" << p.first << ", " << p.second << ")" << endl;
// sort
#define sort_r(x, y) sort(x, y, greater<lli>()); // 降順(5,4,3,,,)
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
typedef long long int lli;
typedef pair<lli, lli> P;
typedef tuple<lli, lli, lli> tup;
int main() {
lli n, m;
cin2(n, m);
lli x[m];
ncin1(m, x);
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x, x + m);
priority_queue<lli> que;
lli ans = x[m - 1] - x[0];
REP(i, 0, m - 1) {
// cout1(x[i]);
que.push(x[i + 1] - x[i]);
}
REP(i, 0, n - 1) {
ans -= que.top();
que.pop();
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// iterator
#define REP(i, init, n) for (lli i = init; i < n; i++)
#define REPE(i, init, n) for (lli i = init; i <= n; i++)
#define REPIT(it, container) \
for (auto it = container.begin(); it != container.end(); it++)
#define REPIT_R(it, container) \
for (auto it = container.rbegin(); it != container.rend(); it++)
// input
#define cin1(x) cin >> x
#define cin2(x, y) cin >> x >> y
#define cin3(x, y, z) cin >> x >> y >> z
#define ncin1(n, x) \
REP(i, 0, n) { cin1(x[i]); }
#define ncin2(n, x, y) \
REP(i, 0, n) { cin2(x[i], y[i]); }
#define ncin3(n, x, y, z) \
REP(i, 0, n) { cin3(x[i], y[i], z[i]); }
// output
#define cout1(x) cout << #x << ": " << x << endl;
#define cout2(x, y) cout << #x << ": " << x << ", " << #y << ": " << y << endl;
#define cout3(x, y, z) \
cout << #x << ": " << x << ", " << #y << ": " << y << ", " << #z << ": " \
<< z << endl; \
;
#define ncout1(n, x) \
REP(i, 0, n) { cout << #x << "[" << i << "]: " << x[i] << endl; }
#define coutp(p) \
cout << #p << ":" \
<< " (" << p.first << ", " << p.second << ")" << endl;
// sort
#define sort_r(x, y) sort(x, y, greater<lli>()); // 降順(5,4,3,,,)
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
typedef long long int lli;
typedef pair<lli, lli> P;
typedef tuple<lli, lli, lli> tup;
int main() {
lli n, m;
cin2(n, m);
lli x[m];
ncin1(m, x);
if (m == 1 || n >= m) {
cout << 0 << endl;
return 0;
}
sort(x, x + m);
priority_queue<lli> que;
lli ans = x[m - 1] - x[0];
REP(i, 0, m - 1) {
// cout1(x[i]);
que.push(x[i + 1] - x[i]);
}
REP(i, 0, n - 1) {
ans -= que.top();
que.pop();
}
cout << ans << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 937,828 | 937,829 | u058297300 | cpp |
p03137 | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
long long N, M;
std::cin >> N >> M;
if (N >= M) {
std::cout << 0 << std::endl;
return 0;
}
std::vector<long long> X(M);
for (auto &x : X)
std::cin >> x;
std::sort(X.begin(), X.end());
std::vector<long long> D(M - 1);
for (int i = 0; i < M - 1; i++)
D[i] = X[i + 1] - X[i];
std::sort(D.begin(), D.end(), std::greater<long long>());
int start = std::max<long long>(0, M - N - 2);
long long sum = std::accumulate(D.begin() + start, D.end(), 0);
std::cout << sum << std::endl;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
int main() {
long long N, M;
std::cin >> N >> M;
if (N >= M) {
std::cout << 0 << std::endl;
return 0;
}
std::vector<long long> X(M);
for (auto &x : X)
std::cin >> x;
std::sort(X.begin(), X.end());
std::vector<long long> D(M - 1);
for (int i = 0; i < M - 1; i++)
D[i] = X[i + 1] - X[i];
std::sort(D.begin(), D.end(), std::greater<long long>());
int start = std::max<long long>(0, N - 1);
long long sum = std::accumulate(D.begin() + start, D.end(), 0);
std::cout << sum << std::endl;
return 0;
}
| [
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 937,884 | 937,885 | u896932701 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
vector<long long int> X(N);
for (auto &i : X)
cin >> i;
sort(X.begin(), X.end());
vector<long long int> diffs;
for (int i = 1; i < M; i++) {
diffs.push_back(X[i] - X[i - 1]);
}
sort(diffs.begin(), diffs.end());
long long ans = 0;
for (int i = 0; i < M - N; i++) {
ans += diffs[i];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
vector<long long int> X(M);
for (auto &i : X)
cin >> i;
sort(X.begin(), X.end());
vector<long long int> diffs;
for (int i = 1; i < M; i++) {
diffs.push_back(X[i] - X[i - 1]);
}
sort(diffs.begin(), diffs.end());
long long int ans = 0;
for (int i = 0; i < M - N; i++) {
ans += diffs[i];
}
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 937,896 | 937,897 | u382176401 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
int i;
vector<int> x(m);
for (i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
vector<int> a(m);
for (i = 0; i < m - 1; i++) {
a[i] = x[i + 1] - x[i];
}
sort(a.begin(), a.end());
int ans = 0;
for (i = 0; i < m - n; i++) {
ans += a[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
int i;
vector<int> x(m);
for (i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
vector<int> a(m - 1);
for (i = 0; i < m - 1; i++) {
a[i] = x[i + 1] - x[i];
}
sort(a.begin(), a.end());
int ans = 0;
for (i = 0; i < m - n; i++) {
ans += a[i];
}
cout << ans << endl;
}
| [
"assignment.change"
] | 937,898 | 937,899 | u479790786 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, m;
cin >> n >> m;
ll x[n];
ll cnt = 0;
rep(i, m) { cin >> x[i]; }
if (m == 1 || n >= m) {
cout << 0 << endl;
return 0;
}
sort(x, x + m);
ll dif[m - 1] = {0};
rep(i, m - 1) { dif[i] = x[i + 1] - x[i]; }
ll ans = x[m - 1] - x[0];
sort(dif, dif + m - 1);
rep(i, n - 1) { ans -= dif[m - 2 - i]; }
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 100005
#define NIL -1
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
ll n, m;
cin >> n >> m;
ll x[m];
ll cnt = 0;
rep(i, m) { cin >> x[i]; }
if (m == 1 || n >= m) {
cout << 0 << endl;
return 0;
}
sort(x, x + m);
ll dif[m - 1] = {0};
rep(i, m - 1) { dif[i] = x[i + 1] - x[i]; }
ll ans = x[m - 1] - x[0];
sort(dif, dif + m - 1);
rep(i, n - 1) { ans -= dif[m - 2 - i]; }
cout << ans << endl;
} | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 937,966 | 937,967 | u342051078 | cpp |
p03137 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
using namespace std;
int main() {
long res;
long N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
long X[100009];
for (int i = 1; i <= M; i++)
cin >> X[i];
sort(X + 1, X + M);
long dX[100009];
for (int i = 1; i <= M - 1; i++)
dX[i] = X[i + 1] - X[i];
sort(dX + 1, dX + M);
res = accumulate(dX + 1, dX + M - N + 1, (long)0);
cout << res << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
using namespace std;
int main() {
long res;
long N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
long X[100009];
for (int i = 1; i <= M; i++)
cin >> X[i];
sort(X + 1, X + M + 1);
long dX[100009];
for (int i = 1; i <= M - 1; i++)
dX[i] = X[i + 1] - X[i];
sort(dX + 1, dX + M);
res = accumulate(dX + 1, dX + M - N + 1, (long)0);
cout << res << endl;
} | [
"expression.operation.binary.add"
] | 937,972 | 937,973 | u545674098 | cpp |
p03137 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll N, M;
vector<ll> X;
int main(int argc, char const *argv[]) {
cin >> N >> M;
for (int i = 0; i < M; ++i) {
ll x;
cin >> x;
X.emplace_back(x);
}
sort(X.begin(), X.end());
ll ans = 0;
if (N >= M) {
cout << ans << endl;
return 0;
} else if (N == 1) {
ans = X[X.size() - 1] + X[0];
cout << ans << endl;
return 0;
}
vector<ll> vec;
for (int i = 1; i < M; ++i) {
vec.emplace_back(X[i] - X[i - 1]);
}
sort(vec.rbegin(), vec.rend());
vec.erase(vec.begin() + N - 1, vec.end());
sort(vec.begin(), vec.end());
vector<pair<ll, ll>> pv;
for (int i = 0; i < M && vec.size() > 0;) {
for (int j = i + 1; j < M && vec.size() > 0; ++j) {
if (j == M - 1) {
pv.emplace_back(make_pair(i, j - 1));
i = M;
break;
}
ll dis = X[j] - X[j - 1];
auto itr = std::find(vec.begin(), vec.end(), dis);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) {
pv.emplace_back(make_pair(i, j - 1));
vec.erase(itr);
i = j;
break;
} else
continue;
}
}
for (int i = 0; i < pv.size(); ++i) {
int b = pv[i].first, e = pv[i].second;
ans += X[e] - X[b];
}
ans += X[X.size() - 1] - X[pv[pv.size() - 1].second + 1];
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll N, M;
vector<ll> X;
int main(int argc, char const *argv[]) {
cin >> N >> M;
for (int i = 0; i < M; ++i) {
ll x;
cin >> x;
X.emplace_back(x);
}
sort(X.begin(), X.end());
ll ans = 0;
if (N >= M) {
cout << ans << endl;
return 0;
} else if (N == 1) {
ans = X[X.size() - 1] - X[0];
cout << ans << endl;
return 0;
}
vector<ll> vec;
for (int i = 1; i < M; ++i) {
vec.emplace_back(X[i] - X[i - 1]);
}
sort(vec.rbegin(), vec.rend());
vec.erase(vec.begin() + N - 1, vec.end());
sort(vec.begin(), vec.end());
vector<pair<ll, ll>> pv;
for (int i = 0; i < M && vec.size() > 0;) {
for (int j = i + 1; j < M && vec.size() > 0; ++j) {
if (j == M - 1) {
pv.emplace_back(make_pair(i, j - 1));
i = M;
break;
}
ll dis = X[j] - X[j - 1];
auto itr = std::find(vec.begin(), vec.end(), dis);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) {
pv.emplace_back(make_pair(i, j - 1));
vec.erase(itr);
i = j;
break;
} else
continue;
}
}
for (int i = 0; i < pv.size(); ++i) {
int b = pv[i].first, e = pv[i].second;
ans += X[e] - X[b];
}
ans += X[X.size() - 1] - X[pv[pv.size() - 1].second + 1];
cout << ans << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 937,990 | 937,991 | u391752022 | cpp |
p03137 | #include <bits/stdc++.h>
using namespace std;
long N, M;
vector<long> L;
vector<long> X;
int main() {
scanf("%ld%ld", &N, &M);
long x;
for (int i = 0; i < M; i++) {
scanf("%ld", &x);
X.push_back(x);
}
if (M < N) {
printf("%d\n", 0);
return 0;
}
sort(X.begin(), X.end());
long sum = 0;
for (long i = 0; i < M; i++) {
L.push_back(X[i + 1] - X[i]);
}
sum = *(X.end() - 1) - *X.begin();
sort(L.begin(), L.end(), greater<long>());
for (long i = 0; i < N - 1; i++) {
sum -= L[i];
}
printf("%ld", sum);
}
| #include <bits/stdc++.h>
using namespace std;
long N, M;
vector<long> L;
vector<long> X;
int main() {
scanf("%ld%ld", &N, &M);
long x;
for (int i = 0; i < M; i++) {
scanf("%ld", &x);
X.push_back(x);
}
if (M <= N) {
printf("%d\n", 0);
return 0;
}
sort(X.begin(), X.end());
long sum = 0;
for (long i = 0; i < M - 1; i++) {
L.push_back(X[i + 1] - X[i]);
}
sum = *(X.end() - 1) - *X.begin();
sort(L.begin(), L.end(), greater<long>());
for (long i = 0; i < N - 1; i++) {
sum -= L[i];
}
printf("%ld", sum);
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 937,992 | 937,993 | u570486288 | cpp |
p03137 |
#include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int m;
scanf("%d", &m);
if (n >= m) {
printf("0\n");
return 0;
}
set<int> a, diff;
for (size_t i = 0; i < m; i++) {
int x;
scanf("%d", &x);
a.emplace(x);
}
auto itr = a.begin();
itr++;
for (; itr != a.end(); ++itr) {
diff.emplace(*itr - *prev(itr));
}
int count = *(--a.end()) - (*(a.begin()));
itr = diff.end();
for (size_t i = 1; i < n; i++) {
itr--;
count -= *itr;
}
printf("%d\n", count);
return 0;
} | #include <algorithm>
#include <climits>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int m;
scanf("%d", &m);
if (n >= m) {
printf("0\n");
return 0;
}
set<int> a;
multiset<int> diff;
for (size_t i = 0; i < m; i++) {
int x;
scanf("%d", &x);
a.emplace(x);
}
auto itr = a.begin();
itr++;
for (; itr != a.end(); ++itr) {
diff.emplace(*itr - *prev(itr));
}
int count = *(--a.end()) - (*(a.begin()));
itr = diff.end();
for (size_t i = 1; i < n; i++) {
itr--;
count -= *itr;
}
printf("%d\n", count);
return 0;
} | [] | 938,019 | 938,020 | u140640995 | cpp |
p03137 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#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>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
//#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
// mp::cpp_int
int solve() {
int n, m;
cin >> n >> m;
vi a;
rep(i, 0, n) {
int x;
cin >> x;
a.pb(x);
}
sort(all(a));
if (n >= m) {
cout << 0;
return 0;
}
vi b;
rep(i, 1, n) { b.pb(a[i] - a[i - 1]); }
sort(all(b));
ll ans = 0;
rep(i, 0, m - n) { ans += b[i]; }
cout << ans;
return 0;
}
int main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
clock_t time_req;
// Without using pow function
time_req = clock();
// cin>>t;
while (t--) {
solve();
}
time_req = clock() - time_req;
// cout << "Processor time taken is "
//<< (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#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>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
//#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
// mp::cpp_int
int solve() {
int n, m;
cin >> n >> m;
vi a;
rep(i, 0, m) {
int x;
cin >> x;
a.pb(x);
}
sort(all(a));
if (n >= m) {
cout << 0;
return 0;
}
vi b;
rep(i, 1, m) { b.pb(a[i] - a[i - 1]); }
sort(all(b));
ll ans = 0;
rep(i, 0, m - n) { ans += b[i]; }
cout << ans;
return 0;
}
int main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
clock_t time_req;
// Without using pow function
time_req = clock();
// cin>>t;
while (t--) {
solve();
}
time_req = clock() - time_req;
// cout << "Processor time taken is "
//<< (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 938,055 | 938,056 | u240509821 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.