problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N >= M) {
cout << 0 << endl;
return 1;
}
sort(X.begin(), X.end());
int sum_difference = 0;
vector<int> difference(M - 1);
for (int i = 0; i < M - 1; i++) {
difference[i] = abs(X[i + 1] - X[i]);
sum_difference += difference[i];
}
sort(difference.begin(), difference.end());
// for (int i = 0; i < M - 1; i++) {
// cout << i << ":" << difference[i] << endl;
// }
int answer = sum_difference;
for (int i = 0; i < N - 1; i++) {
answer -= difference[(M - 1) - 1 - i];
}
cout << answer << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N >= M) {
cout << 0 << endl;
return 0;
}
sort(X.begin(), X.end());
int sum_difference = 0;
vector<int> difference(M - 1);
for (int i = 0; i < M - 1; i++) {
difference[i] = abs(X[i + 1] - X[i]);
sum_difference += difference[i];
}
sort(difference.begin(), difference.end());
// for (int i = 0; i < M - 1; i++) {
// cout << i << ":" << difference[i] << endl;
// }
int answer = sum_difference;
for (int i = 0; i < N - 1; i++) {
answer -= difference[(M - 1) - 1 - i];
}
cout << answer << endl;
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, start, end) for (int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << (x) << endl;
#define INF (1e9)
#define add_mod(a, b, x) ((ll)(a) + (ll)(b)) % (ll)(x)
#define mul_mod(a, b, x) (((ll)(a) % (ll)(x)) * ((ll)(b) % (ll)(x))) % (ll)(x)
ll sub_mod(ll a, ll b, ll x) {
ll tmp = (a - b) % x;
if (tmp < 0)
tmp += x;
return tmp;
}
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> nums(m), dist(m);
rep(i, m) { cin >> nums[i]; }
sort(all(nums));
rep(i, m) {
if (i != 0)
dist[i] = nums[i] - nums[i - 1];
}
sort(all(dist));
rep(i, n - 1) { dist[m - 1 - i] = 0; }
cout << accumulate(all(dist), 0) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repi(i, start, end) for (int i = start; i < end; i++)
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << (x) << endl;
#define INF (1e9)
#define add_mod(a, b, x) ((ll)(a) + (ll)(b)) % (ll)(x)
#define mul_mod(a, b, x) (((ll)(a) % (ll)(x)) * ((ll)(b) % (ll)(x))) % (ll)(x)
ll sub_mod(ll a, ll b, ll x) {
ll tmp = (a - b) % x;
if (tmp < 0)
tmp += x;
return tmp;
}
int dx[] = {0, 1, 0, -1};
int dy[] = {-1, 0, 1, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> nums(m), dist(m);
rep(i, m) { cin >> nums[i]; }
sort(all(nums));
rep(i, m) {
if (i != 0)
dist[i] = nums[i] - nums[i - 1];
}
sort(all(dist));
rep(i, n - 1) {
if (m - 1 - i > 0)
dist[m - 1 - i] = 0;
}
cout << accumulate(all(dist), 0) << endl;
} | replace | 40 | 41 | 40 | 44 | 0 | |
p03137 | C++ | Time Limit Exceeded | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// chmax chmin
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main(void) {
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());
vector<int> step;
FOR(i, 1, M) step.push_back(X[i] - X[i - 1]);
REP(i, N - 1) {
sort(step.begin(), step.end());
reverse(step.begin(), step.end());
step[0] = 0;
}
sort(step.begin(), step.end());
reverse(step.begin(), step.end());
int ans = 0;
REP(i, M) {
int elem = step[i];
if (elem == 0)
break;
ans += elem;
}
cout << ans << endl;
return 0;
} | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef long long ll;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// chmax chmin
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main(void) {
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());
vector<int> step;
FOR(i, 1, M) step.push_back(X[i] - X[i - 1]);
sort(step.begin(), step.end());
reverse(step.begin(), step.end());
REP(i, N - 1) step[i] = 0;
sort(step.begin(), step.end());
reverse(step.begin(), step.end());
int ans = 0;
REP(i, M) {
int elem = step[i];
if (elem == 0)
break;
ans += elem;
}
cout << ans << endl;
return 0;
} | replace | 102 | 107 | 102 | 105 | TLE | |
p03137 | Python | Runtime Error | import sys
n, m = map(int, input().split())
x = list(map(int, input().split()))
if m == 1:
print(0)
sys.exit()
if n == 1:
print(max(x) - min(x))
sys.exit()
x.sort()
a = []
for i in range(m - 1):
a.append(abs(x[i] - x[i + 1]))
ans = sum(a)
a.sort(reverse=True)
for i in range(n - 1):
ans -= a[i]
print(max(0, ans))
| import sys
n, m = map(int, input().split())
x = list(map(int, input().split()))
if m == 1:
print(0)
sys.exit()
if n == 1:
print(max(x) - min(x))
sys.exit()
if n >= m:
print(0)
sys.exit()
x.sort()
a = []
for i in range(m - 1):
a.append(abs(x[i] - x[i + 1]))
ans = sum(a)
a.sort(reverse=True)
for i in range(n - 1):
ans -= a[i]
print(max(0, ans))
| insert | 10 | 10 | 10 | 13 | 0 | |
p03137 | Python | Runtime Error | def main():
N, M = map(int, input().split())
X = sorted(list(map(int, input().split())))
if M == 1:
print(0)
elif N == 1:
print(max(X) - min(X))
else:
dx = [abs(X[m] - X[m + 1]) for m in range(M - 1)]
for _ in range(N - 1):
dx.pop(dx.index(max(dx)))
print(sum(dx))
main()
| def main():
N, M = map(int, input().split())
X = sorted(list(map(int, input().split())))
if M == 1:
print(0)
elif N == 1:
print(max(X) - min(X))
else:
if N > M:
N = M
dx = sorted([abs(X[m] - X[m + 1]) for m in range(M - 1)])
print(sum(dx[: M - N]))
main()
| replace | 9 | 13 | 9 | 13 | 0 | |
p03137 | Python | Time Limit Exceeded | N, M = map(int, input().split())
X = list(map(int, input().split()))
X.sort()
if N >= M:
ans = 0
else:
x_diff = [X[i + 1] - X[i] for i in range(len(X) - 1)]
for _ in range(N - 1):
x_diff.remove(max(x_diff))
ans = sum(x_diff)
print(ans)
| N, M = map(int, input().split())
X = list(map(int, input().split()))
X.sort()
if N >= M:
ans = 0
else:
x_diff = [
xn - x for xn, x in zip(X[1:], X[:-1])
] # [X[i + 1] - X[i] for i in range(len(X) - 1)]
# for _ in range(N - 1):
# x_diff.remove(max(x_diff))
x_diff.sort(reverse=True)
ans = sum(x_diff[N - 1 :])
print(ans)
| replace | 7 | 11 | 7 | 14 | TLE | |
p03137 | Python | Runtime Error | def solve():
n, m = map(int, input().split())
x = list(map(int, input().split()))
x.sort()
diff = [x[i + 1] - x[i] for i in range(m)]
diff.sort(reverse=True)
return sum(diff[n - 1 :])
if __name__ == "__main__":
print(solve())
| def solve():
n, m = map(int, input().split())
x = sorted(list(map(int, input().split())))
diff = sorted([x[i + 1] - x[i] for i in range(m - 1)], reverse=True)
return sum(diff[n - 1 :])
if __name__ == "__main__":
print(solve())
| replace | 2 | 6 | 2 | 4 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03137/Python/s563492969.py", line 11, in <module>
print(solve())
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03137/Python/s563492969.py", line 5, in solve
diff = [x[i + 1] - x[i] for i in range(m)]
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03137/Python/s563492969.py", line 5, in <listcomp>
diff = [x[i + 1] - x[i] for i in range(m)]
IndexError: list index out of range
|
p03137 | Python | Runtime Error | N, M = map(int, input().split())
x = list(map(int, input().split()))
x.sort()
s = [0] * (M - 1)
for i in range(M - 1):
s[i] = x[i + 1] - x[i]
s.sort(reverse=True)
res = sum(s)
if M == 1:
print(0)
quit()
else:
for i in range(N - 1):
res -= s[i]
print(res)
| N, M = map(int, input().split())
x = list(map(int, input().split()))
if N >= M:
print(0)
quit()
x.sort()
s = [0] * (M - 1)
for i in range(M - 1):
s[i] = x[i + 1] - x[i]
s.sort(reverse=True)
res = sum(s)
if M == 1:
print(0)
quit()
else:
for i in range(N - 1):
res -= s[i]
print(res)
| insert | 2 | 2 | 2 | 6 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> X(M);
for (int i = 0; i < M; i++)
cin >> X[i];
sort(X.begin(), X.end());
vector<long long> Y(M - 1);
for (int i = 0; i < M - 1; i++)
Y[i] = X[i + 1] - X[i];
sort(Y.begin(), Y.end());
long long ans = 0;
while (M > N) {
for (int i = 0; i < Y.size() - (N - 1); i++)
ans += Y[i];
cout << ans << endl;
}
cout << "0" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> X(M);
for (int i = 0; i < M; i++)
cin >> X[i];
sort(X.begin(), X.end());
vector<long long> Y(M - 1);
for (int i = 0; i < M - 1; i++)
Y[i] = X[i + 1] - X[i];
sort(Y.begin(), Y.end());
long long ans = 0;
while (M > N) {
for (int i = 0; i < Y.size() - (N - 1); i++)
ans += Y[i];
cout << ans << endl;
return 0;
}
cout << "0" << endl;
return 0;
} | insert | 24 | 24 | 24 | 25 | TLE | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m), diff(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
adjacent_difference(x.begin(), x.end(), diff.begin());
diff[0] = -100001;
sort(diff.begin(), diff.end());
int ans = accumulate(diff.begin() + 1, diff.end() - n + 1, 0);
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;
}
vector<int> x(m), diff(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
adjacent_difference(x.begin(), x.end(), diff.begin());
diff[0] = -100001;
sort(diff.begin(), diff.end());
int ans = accumulate(diff.begin() + 1, diff.end() - n + 1, 0);
cout << ans << endl;
} | insert | 6 | 6 | 6 | 10 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template <class T> void print1d(T x, ll n = -1) {
if (n == -1)
n = x.size();
rep(i, 0, n) { cout << x[i] << ' '; }
cout << '\n';
}
template <class T> void print2d(T x, ll r = -1, ll c = -1) {
if (r == -1)
r = x.size();
if (c == -1)
c = x[0].size();
rep(i, 0, r) print1d(x[i], c);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> T rem(T a, U b) { return a - b * floor(a / b); }
template <class T> ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template <class T> ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main() {
ll N, M;
cin >> N >> M;
vll X(M);
rep(i, 0, M) cin >> X[i];
sort(all(X));
if (M == 1) {
cout << 0 << endl;
return 0;
}
vll diff(M - 1);
rep(i, 0, M - 1) { diff[i] = X[i + 1] - X[i]; }
sort(all(diff));
ll ans = accumulate(diff.begin(), diff.begin() + len(diff) - N + 1, 0LL);
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, start, end) for (long long i = start; i < end; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((long long)(x).size())
#define g(a, b) __gcd((a), (b))
#define l(a, b) ((a) / __gcd((a), (b)) * (b))
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vllvll = vector<vll>;
using pll = pair<ll, ll>;
template <class T> void print1d(T x, ll n = -1) {
if (n == -1)
n = x.size();
rep(i, 0, n) { cout << x[i] << ' '; }
cout << '\n';
}
template <class T> void print2d(T x, ll r = -1, ll c = -1) {
if (r == -1)
r = x.size();
if (c == -1)
c = x[0].size();
rep(i, 0, r) print1d(x[i], c);
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> T rem(T a, U b) { return a - b * floor(a / b); }
template <class T> ld deg2rad(T deg) { return M_PI * deg / 180.0; }
template <class T> ld rad2deg(T rad) { return 180.0 * rad / M_PI; }
const long double pi = M_PI;
const long long big = 1LL << 50;
const long long inf = 1LL << 60;
const long long mod = 1e9 + 7;
int main() {
ll N, M;
cin >> N >> M;
vll X(M);
rep(i, 0, M) cin >> X[i];
sort(all(X));
if (M <= N) {
cout << 0 << endl;
return 0;
}
vll diff(M - 1);
rep(i, 0, M - 1) { diff[i] = X[i + 1] - X[i]; }
sort(all(diff));
ll ans = accumulate(diff.begin(), diff.begin() + len(diff) - N + 1, 0LL);
cout << ans << endl;
}
| replace | 55 | 56 | 55 | 56 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 100100100
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
#define mod 998244353
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
sort(x.begin(), x.end());
ll ans = x[m - 1] - x[0];
priority_queue<int> q;
for (int i = 0; i < m - 1; i++) {
q.push(abs(x[i + 1] - x[i]));
}
while (n > 1) {
ans -= q.top();
q.pop();
n--;
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 100100100
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
#define mod 998244353
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
if (m == 1) {
cout << 0 << endl;
return 0;
}
if (n >= m) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
ll ans = x[m - 1] - x[0];
priority_queue<int> q;
for (int i = 0; i < m - 1; i++) {
q.push(abs(x[i + 1] - x[i]));
}
while (n > 1) {
ans -= q.top();
q.pop();
n--;
}
cout << ans << endl;
}
| insert | 26 | 26 | 26 | 34 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M;
int X[10005];
int diff[10005];
cin >> N >> M;
for (int i = 0; i < M; ++i)
cin >> X[i];
sort(X, X + M);
for (int i = 0; i < M - 1; ++i)
diff[i] = X[i + 1] - X[i];
sort(diff, diff + (M - 1));
int ans = 0;
for (int i = 0; i < M - N; ++i)
ans += diff[i];
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M;
int X[100005];
int diff[100005];
cin >> N >> M;
for (int i = 0; i < M; ++i)
cin >> X[i];
sort(X, X + M);
for (int i = 0; i < M - 1; ++i)
diff[i] = X[i + 1] - X[i];
sort(diff, diff + (M - 1));
int ans = 0;
for (int i = 0; i < M - N; ++i)
ans += diff[i];
cout << ans << endl;
return 0;
}
| replace | 6 | 8 | 6 | 8 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
typedef long long ll;
ll mod = 1000000007;
int numsplit(vector<tuple<int, int, int>> &vt, vector<int> &vpos) {
int cntsplit = 1;
auto tmp = vt;
sort(all(tmp), [](tuple<int, int, int> &a, tuple<int, int, int> &b) {
return get<0>(a) < get<0>(b);
});
int pos = vpos[0];
for (int l = 0; l < tmp.size(); ++l) {
cntsplit += distance(find(all(vpos), pos), find(all(vpos), get<0>(tmp[l])));
pos = get<1>(tmp[l]);
}
cntsplit +=
distance(find(all(vpos), pos), find(all(vpos), vpos[vpos.size() - 1]));
return cntsplit;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> v(m);
for (int i = 0; i < m; ++i) {
cin >> v[i];
}
sort(all(v));
if (n >= m) {
cout << 0 << endl;
return 0;
}
vector<tuple<int, int, int>> vt;
for (int j = 1; j < m; ++j) {
vt.push_back(make_tuple(v[j - 1], v[j], v[j] - v[j - 1]));
}
sort(all(vt), [](tuple<int, int, int> &a, tuple<int, int, int> &b) {
return get<2>(a) < get<2>(b);
});
while (numsplit(vt, v) < n) {
vt.pop_back();
}
int out = 0;
for (int k = 0; k < vt.size(); ++k) {
out += get<2>(vt[k]);
}
cout << out << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
typedef long long ll;
ll mod = 1000000007;
int numsplit(vector<tuple<int, int, int>> &vt, vector<int> &vpos) {
int cntsplit = 1;
auto tmp = vt;
sort(all(tmp), [](tuple<int, int, int> &a, tuple<int, int, int> &b) {
return get<0>(a) < get<0>(b);
});
int pos = vpos[0];
for (int l = 0; l < tmp.size(); ++l) {
cntsplit += distance(find(all(vpos), pos), find(all(vpos), get<0>(tmp[l])));
pos = get<1>(tmp[l]);
}
cntsplit +=
distance(find(all(vpos), pos), find(all(vpos), vpos[vpos.size() - 1]));
return cntsplit;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> v(m);
for (int i = 0; i < m; ++i) {
cin >> v[i];
}
sort(all(v));
if (n >= m) {
cout << 0 << endl;
return 0;
}
vector<tuple<int, int, int>> vt;
for (int j = 1; j < m; ++j) {
vt.push_back(make_tuple(v[j - 1], v[j], v[j] - v[j - 1]));
}
sort(all(vt), [](tuple<int, int, int> &a, tuple<int, int, int> &b) {
return get<2>(a) < get<2>(b);
});
// while(numsplit(vt, v) < n){
// vt.pop_back();
// }
vt.resize(vt.size() - n + 1);
int out = 0;
for (int k = 0; k < vt.size(); ++k) {
out += get<2>(vt[k]);
}
cout << out << endl;
return 0;
}
| replace | 41 | 44 | 41 | 45 | TLE | |
p03137 | C++ | Runtime Error | /*|In The Name of Allah|*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<int, int>> vii;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef pair<int, int> pii;
#define el '\n'
#define lp(i, n) for (int i = 0; i < int(n); i++)
#define rlp(i, n) for (int i = (n)-1; i >= 0; i--)
#define rng(i, a, b) for (int i = int(a); i <= int(b); i++)
#define mp(x, y) make_pair((x), (y))
#define pb(x) push_back((x))
#define all(v) ((v).begin()), ((v).end())
#define sz(x) ((int)(x).size())
#define bits(a) __builtin_popcountll(a)
#define fr first
#define sc second
#define pii pair<int, int>
#define sortva(v) sort(all(v))
#define sortvd(v) sort(v.rbegin(), v.rend())
#define sortaa(a, n) sort(a, a + n)
#define sortad(a, n) sort(a, a + n), reverse(a, a + n)
#define SS stringstream
#define ll long long
#define clr(x, y) memset(x, y, sizeof(x))
#define foreach(it, x) \
for (__typeof__((x).begin()) it = (x).begin(); it != (x).end(); ++it)
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
void MisSiOn_ImPosSiBlE() {
// freopen("portals.in", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int const N = 1e3 + 9, mod = 1e9 + 7, oo = 0x3f3f3f3f;
//------------------------------------------------------------------------------------
int n;
ll res, arr[N];
int main() {
MisSiOn_ImPosSiBlE();
vi v;
int m;
cin >> m >> n;
m--;
lp(i, n) cin >> arr[i];
sort(arr, arr + n);
for (int i = 1; i < n; i++) {
v.push_back(arr[i] - arr[i - 1]);
}
sortvd(v);
lp(i, v.size()) {
if (m)
m--;
else {
res += v[i];
}
}
cout << res;
/*
*/
return 0;
}
| /*|In The Name of Allah|*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<pair<int, int>> vii;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef pair<int, int> pii;
#define el '\n'
#define lp(i, n) for (int i = 0; i < int(n); i++)
#define rlp(i, n) for (int i = (n)-1; i >= 0; i--)
#define rng(i, a, b) for (int i = int(a); i <= int(b); i++)
#define mp(x, y) make_pair((x), (y))
#define pb(x) push_back((x))
#define all(v) ((v).begin()), ((v).end())
#define sz(x) ((int)(x).size())
#define bits(a) __builtin_popcountll(a)
#define fr first
#define sc second
#define pii pair<int, int>
#define sortva(v) sort(all(v))
#define sortvd(v) sort(v.rbegin(), v.rend())
#define sortaa(a, n) sort(a, a + n)
#define sortad(a, n) sort(a, a + n), reverse(a, a + n)
#define SS stringstream
#define ll long long
#define clr(x, y) memset(x, y, sizeof(x))
#define foreach(it, x) \
for (__typeof__((x).begin()) it = (x).begin(); it != (x).end(); ++it)
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
void MisSiOn_ImPosSiBlE() {
// freopen("portals.in", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int const N = 5e5 + 9, mod = 1e9 + 7, oo = 0x3f3f3f3f;
//------------------------------------------------------------------------------------
int n;
ll res, arr[N];
int main() {
MisSiOn_ImPosSiBlE();
vi v;
int m;
cin >> m >> n;
m--;
lp(i, n) cin >> arr[i];
sort(arr, arr + n);
for (int i = 1; i < n; i++) {
v.push_back(arr[i] - arr[i - 1]);
}
sortvd(v);
lp(i, v.size()) {
if (m)
m--;
else {
res += v[i];
}
}
cout << res;
/*
*/
return 0;
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 1;
}
vector<int> X(M);
for (int i; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> Y(M - 1);
for (int i = 0; i < M - 1; i++) {
Y[i] = X[i + 1] - X[i];
}
sort(Y.begin(), Y.end());
long long XX = X[X.size() - 1] - X[0], sumY = 0;
for (int i = 0; i < N - 1; i++) {
sumY += Y[Y.size() - 1 - i];
}
cout << XX - sumY << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> Y(M - 1);
for (int i = 0; i < M - 1; i++) {
Y[i] = X[i + 1] - X[i];
}
sort(Y.begin(), Y.end());
long long XX = X[X.size() - 1] - X[0], sumY = 0;
for (int i = 0; i < N - 1; i++) {
sumY += Y[Y.size() - 1 - i];
}
cout << XX - sumY << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
if (m == 1)
cout << 0;
else {
vector<int> x(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
vector<int> d(m - 1);
for (int i = 0; i < m - 1; i++)
d[i] = x[i + 1] - x[i];
sort(d.begin(), d.end());
for (int i = 0; i < n - 1; i++)
d.pop_back();
int ans = 0;
for (int i = 0; i < d.size(); i++)
ans += d[i];
cout << ans;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
vector<int> d(m - 1);
for (int i = 0; i < m - 1; i++)
d[i] = x[i + 1] - x[i];
sort(d.begin(), d.end());
for (int i = 0; i < n - 1; i++)
d.pop_back();
int ans = 0;
for (int i = 0; i < m - n; i++)
ans += d[i];
cout << ans;
}
| replace | 5 | 23 | 5 | 19 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#define sz(s) (int)(s.size())
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int maxn = 1e5 + 5;
const double EPS = 1e-14;
const int MOD = 1e9 + 7;
/*
ll xo,yo,z;
void extend_euclidean(ll a,ll b)
{ ll temp;
if(b==0)
{
z=a;
xo=1;
yo=0;
}
else
{
extend_euclidean(b,a%b);
temp=xo;
xo=yo;
yo=temp-(a/b)*yo;
}
return;
}
// O(sqrtn)
vector<ll> factorize(ll n) {
vector<ll> res;
for (ll i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res.push_back(i);
n /= i;
}
}
if (n != 1) {
res.push_back(n);
}
return res;
}
*************FACTORIZE IN 0(LOG(N)) PROVIDED N IS INTEGER**************
int minPrime[100000];
void modified_sieve(int n){
for (int i = 2; i * i <= n; ++i) {
if (minPrime[i] == 0) { //If i is prime
for (int j = i * i; j <= n; j += i) {
if (minPrime[j] == 0) {
minPrime[j] = i;
}
}
}
}
for (int i = 2; i <= n; ++i) {
if (minPrime[i] == 0) {
minPrime[i] = i;
}
}
vector<int> factorize(int n) {
vector<int> res;
while (n != 1) {
res.push_back(minPrime[n]);
n /= minPrime[n];
}
return res;
}
*************************************************
bool isPrime[maxn]; o(n log(log(n)))
void sieve()
{
memset(isPrime,true,maxn);
isPrime[0] = false;
isPrime[1] = false;
for(int i = 2; i * i <= maxn ; ++i)
{
if(isPrime[i])
{
for(int j = i * 2; j <= maxn ; j += i)
isPrime[j] = false;
}
}
}
ll binomialCoeff(ll n, ll k)
{
ll res = 1;
if(n<k)
return 0;
// Since C(n, k) = C(n, n-k)
if ( k > n - k )
k = n - k;
// Calculate value of
// [n * (n-1) *---* (n-k+1)] / [k * (k-1) *----* 1]
for (ll i = 0; i < k; ++i)
{
res *= (n - i);
res /= (i + 1);
}
return res;
}
***********************************************************
sieve with linear time complexity o(n)
void faster_sieve(int N)
{
int lp[N+1];
vector<int> pr;
for (int i=2; i<=N; ++i)
{
if (lp[i] == 0)
{
lp[i] = i;
pr.push_back (i);
}
for(int j=0; j<(int)pr.size() && pr[j]<=lp[i] && i*pr[j]<=N; ++j)
lp[i * pr[j]] = pr[j];
}
}
******************************************************************************
faster factorize
vector<long long> factorization(int N){
while (n % 2 == 0) {
factorization.push_back(2);
n /= 2;
}
for (long long d = 3; d * d <= n; d += 2) {
while (n % d == 0) {
factorization.push_back(d);
n /= d;
}
}
if (n > 1)
factorization.push_back(n);
return factorization;
}
ll GCD(ll a,ll b){return (a)?GCD(b%a,a):b;}
ll LCM(ll a, ll b){return a*b/GCD(a,b);}
ll fastpow(ll b, ll p){if(!p)return 1;ll ret = fastpow(b, p >> 1);ret *=
ret;if(p&1)ret*= b;return ret;}
*/
int arr[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr, arr + m);
int cnt = 0;
vector<int> v;
for (int i = 1; i < m; i++) {
cnt = abs(arr[i] - arr[i - 1]);
v.pb(cnt);
}
int x = sz(v) - (n - 1);
int ans = 0;
sort(v.begin(), v.end());
for (int i = 0; i < x; i++)
ans += v[i];
cout << ans;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define bp __builtin_popcount
#define pb push_back
#define sz(s) (int)(s.size())
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
const int maxn = 1e5 + 5;
const double EPS = 1e-14;
const int MOD = 1e9 + 7;
/*
ll xo,yo,z;
void extend_euclidean(ll a,ll b)
{ ll temp;
if(b==0)
{
z=a;
xo=1;
yo=0;
}
else
{
extend_euclidean(b,a%b);
temp=xo;
xo=yo;
yo=temp-(a/b)*yo;
}
return;
}
// O(sqrtn)
vector<ll> factorize(ll n) {
vector<ll> res;
for (ll i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res.push_back(i);
n /= i;
}
}
if (n != 1) {
res.push_back(n);
}
return res;
}
*************FACTORIZE IN 0(LOG(N)) PROVIDED N IS INTEGER**************
int minPrime[100000];
void modified_sieve(int n){
for (int i = 2; i * i <= n; ++i) {
if (minPrime[i] == 0) { //If i is prime
for (int j = i * i; j <= n; j += i) {
if (minPrime[j] == 0) {
minPrime[j] = i;
}
}
}
}
for (int i = 2; i <= n; ++i) {
if (minPrime[i] == 0) {
minPrime[i] = i;
}
}
vector<int> factorize(int n) {
vector<int> res;
while (n != 1) {
res.push_back(minPrime[n]);
n /= minPrime[n];
}
return res;
}
*************************************************
bool isPrime[maxn]; o(n log(log(n)))
void sieve()
{
memset(isPrime,true,maxn);
isPrime[0] = false;
isPrime[1] = false;
for(int i = 2; i * i <= maxn ; ++i)
{
if(isPrime[i])
{
for(int j = i * 2; j <= maxn ; j += i)
isPrime[j] = false;
}
}
}
ll binomialCoeff(ll n, ll k)
{
ll res = 1;
if(n<k)
return 0;
// Since C(n, k) = C(n, n-k)
if ( k > n - k )
k = n - k;
// Calculate value of
// [n * (n-1) *---* (n-k+1)] / [k * (k-1) *----* 1]
for (ll i = 0; i < k; ++i)
{
res *= (n - i);
res /= (i + 1);
}
return res;
}
***********************************************************
sieve with linear time complexity o(n)
void faster_sieve(int N)
{
int lp[N+1];
vector<int> pr;
for (int i=2; i<=N; ++i)
{
if (lp[i] == 0)
{
lp[i] = i;
pr.push_back (i);
}
for(int j=0; j<(int)pr.size() && pr[j]<=lp[i] && i*pr[j]<=N; ++j)
lp[i * pr[j]] = pr[j];
}
}
******************************************************************************
faster factorize
vector<long long> factorization(int N){
while (n % 2 == 0) {
factorization.push_back(2);
n /= 2;
}
for (long long d = 3; d * d <= n; d += 2) {
while (n % d == 0) {
factorization.push_back(d);
n /= d;
}
}
if (n > 1)
factorization.push_back(n);
return factorization;
}
ll GCD(ll a,ll b){return (a)?GCD(b%a,a):b;}
ll LCM(ll a, ll b){return a*b/GCD(a,b);}
ll fastpow(ll b, ll p){if(!p)return 1;ll ret = fastpow(b, p >> 1);ret *=
ret;if(p&1)ret*= b;return ret;}
*/
int arr[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
#endif
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++)
cin >> arr[i];
sort(arr, arr + m);
int cnt = 0;
vector<int> v;
for (int i = 1; i < m; i++) {
cnt = abs(arr[i] - arr[i - 1]);
v.pb(cnt);
}
int x = sz(v) - (n - 1);
int ans = 0;
sort(v.begin(), v.end());
for (int i = 0; i < x; i++)
ans += v[i];
cout << ans;
}
| replace | 167 | 168 | 167 | 168 | -11 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k = 0;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
if (n >= m) {
k = 0;
} else {
vector<int> y(m - 1);
for (int i = 0; i < m - 1; i++) {
y.at(i) = x.at(i + 1) - x.at(i);
}
sort(y.begin(), y.end());
for (int i = 0; i < m - n + 1; i++) {
k += y.at(i);
}
}
cout << k << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, k = 0;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
if (n >= m) {
k = 0;
} else {
vector<int> y(m - 1);
for (int i = 0; i < m - 1; i++) {
y.at(i) = x.at(i + 1) - x.at(i);
}
sort(y.begin(), y.end());
for (int i = 0; i < m - n; i++) {
k += y.at(i);
}
}
cout << k << endl;
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
vector<int> diffs(m);
for (int i = 1; i < m; i++) {
diffs.push_back(x[i] - x[i - 1]);
}
sort(diffs.begin(), diffs.end(), greater<int>());
int ans = x[m - 1] - x[0];
for (int i = 0; i < n - 1; i++) {
ans -= diffs[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
vector<int> diffs(m);
for (int i = 1; i < m; i++) {
diffs.push_back(x[i] - x[i - 1]);
}
sort(diffs.begin(), diffs.end(), greater<int>());
int ans = x[m - 1] - x[0];
for (int i = 0; i < min((int)diffs.size(), n - 1); i++) {
ans -= diffs[i];
}
cout << ans << endl;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(all(x));
#define RSORT(x) sort(rall(x));
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using tiii = tuple<int, int, int>;
const ll inf = 1ll << 29;
const ll mod = 1000000007;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// cout << fixed << setprecision(10);
int main() {
int N, M;
cin >> N >> M;
vi X(M);
rep(i, M) cin >> X.at(i);
SORT(X);
vi d(M - 1);
rep(i, M - 1) { d.at(i) = X.at(i + 1) - X.at(i); }
SORT(d);
rep(i, N - 1) { d.pop_back(); }
cout << accumulate(all(d), 0) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SORT(x) sort(all(x));
#define RSORT(x) sort(rall(x));
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vb = vector<bool>;
using pii = pair<int, int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
using tiii = tuple<int, int, int>;
const ll inf = 1ll << 29;
const ll mod = 1000000007;
const double eps = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// cout << fixed << setprecision(10);
int main() {
int N, M;
cin >> N >> M;
vi X(M);
rep(i, M) cin >> X.at(i);
if (N >= M) {
cout << 0 << endl;
return 0;
}
SORT(X);
vi d(M - 1);
rep(i, M - 1) { d.at(i) = X.at(i + 1) - X.at(i); }
SORT(d);
rep(i, N - 1) { d.pop_back(); }
cout << accumulate(all(d), 0) << endl;
} | insert | 34 | 34 | 34 | 39 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define P pair<int, int>
using namespace std;
using ll = int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
int n, m, res = 0;
vector<int> x, cost;
cin >> n >> m;
rep(i, m) {
int temp;
cin >> temp;
x.push_back(temp);
}
sort(x.begin(), x.end());
for (auto i = x.begin(); i != x.end(); i++) {
if (i == x.end() - 1)
break;
int c = (*(i + 1)) - (*i);
// cout << "cost: " << c << endl;
cost.push_back(c);
res += c;
}
// cout << "res: " << res << endl;
sort(cost.begin(), cost.end());
reverse(cost.begin(), cost.end());
if (m == 1) {
cout << 0 << endl;
return;
} else {
for (int i = 0; i < n - 1; i++) {
res -= cost[i];
}
}
cout << res << endl;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define mod 1000000007
#define INF2 9999999999
#define INF (1 << 30)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define P pair<int, int>
using namespace std;
using ll = int64_t;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int DX[] = {1, 1, 0, -1, -1, -1, 0, 1};
int DY[] = {0, -1, -1, -1, 0, 1, 1, 1};
void solve() {
int n, m, res = 0;
vector<int> x, cost;
cin >> n >> m;
rep(i, m) {
int temp;
cin >> temp;
x.push_back(temp);
}
sort(x.begin(), x.end());
for (auto i = x.begin(); i != x.end(); i++) {
if (i == x.end() - 1)
break;
int c = (*(i + 1)) - (*i);
// cout << "cost: " << c << endl;
cost.push_back(c);
res += c;
}
// cout << "res: " << res << endl;
sort(cost.begin(), cost.end());
reverse(cost.begin(), cost.end());
if (n >= m) {
cout << 0 << endl;
return;
} else {
for (int i = 0; i < n - 1; i++) {
res -= cost[i];
}
}
cout << res << endl;
}
int main() {
solve();
return 0;
} | replace | 51 | 52 | 51 | 52 | 0 | |
p03137 | C++ | Runtime Error | #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;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define uint __int128_t
#define pb push_back
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(v) (v).begin(), (v).end()
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
#define low(a, b) lower_bound(all(a), (b)) - (a).begin()
#define upp(a, b) upper_bound(all(a), (b)) - (a).begin()
#define endl '\n'
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0)
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<pint> vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;
signed main() {
IOS();
//(1ll<<N)シフト演算のオーバーフローに気をつける
// MOD同士の引き算に注意
int N, M;
cin >> N >> M;
if (M == 1) {
cout << 0 << endl;
return 0;
}
vint v(M);
rep(i, 0, M) cin >> v[i];
sort(all(v));
vint a(M - 1);
int ans = 0;
rep(i, 0, M - 1) {
a[i] = v[i + 1] - v[i];
ans += a[i];
}
sort(all(a));
reverse(all(a));
rep(i, 0, N - 1) ans -= a[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define uint __int128_t
#define pb push_back
#define fi first
#define se second
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(v) (v).begin(), (v).end()
#define chmin(a, b) a = min((a), (b))
#define chmax(a, b) a = max((a), (b))
#define low(a, b) lower_bound(all(a), (b)) - (a).begin()
#define upp(a, b) upper_bound(all(a), (b)) - (a).begin()
#define endl '\n'
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0)
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vint;
typedef vector<vint> vvint;
typedef vector<pint> vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;
signed main() {
IOS();
//(1ll<<N)シフト演算のオーバーフローに気をつける
// MOD同士の引き算に注意
int N, M;
cin >> N >> M;
if (M == 1 || N >= M) {
cout << 0 << endl;
return 0;
}
vint v(M);
rep(i, 0, M) cin >> v[i];
sort(all(v));
vint a(M - 1);
int ans = 0;
rep(i, 0, M - 1) {
a[i] = v[i + 1] - v[i];
ans += a[i];
}
sort(all(a));
reverse(all(a));
rep(i, 0, N - 1) ans -= a[i];
cout << ans << endl;
return 0;
} | replace | 39 | 40 | 39 | 40 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
sort(x.begin(), x.end());
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<int> interval(m - 1);
rep(i, m - 1) interval[i] = x[i + 1] - x[i];
sort(interval.begin(), interval.end());
ll ans = 0;
rep(i, m - 1) ans += interval[i];
rep(i, n - 1) ans -= interval[m - 2 - i];
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
using ll = long long;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
sort(x.begin(), x.end());
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<int> interval(m - 1);
rep(i, m - 1) interval[i] = x[i + 1] - x[i];
sort(interval.begin(), interval.end());
ll ans = 0;
for (int i = 0; i < m - n; i++) {
ans += interval[i];
}
cout << ans << endl;
} | replace | 19 | 21 | 19 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, m;
cin >> n >> m;
vector<ll> a(m);
for (auto &x : a)
cin >> x;
sort(a.begin(), a.end());
vector<ll> dist;
for (ll i = 0; i < m - 1; ++i)
dist.emplace_back(a[i + 1] - a[i]);
sort(dist.begin(), dist.end(), greater<ll>());
ll ans = a.back() - a.front();
for (ll i = 0; i < n - 1; ++i) {
ans -= dist[i];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
signed main() {
ll n, m;
cin >> n >> m;
vector<ll> a(m);
for (auto &x : a)
cin >> x;
sort(a.begin(), a.end());
vector<ll> dist;
for (ll i = 0; i < m - 1; ++i)
dist.emplace_back(a[i + 1] - a[i]);
sort(dist.begin(), dist.end(), greater<ll>());
ll ans = a.back() - a.front();
for (ll i = 0; i < min((ll)dist.size(), n - 1); ++i) {
ans -= dist[i];
}
cout << ans << endl;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int N, M, X[10000];
int d[10000], ans;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N < M) {
sort(X, X + M);
for (int i = 0; i < M - 1; i++) {
d[i] = X[i + 1] - X[i];
}
sort(d, d + (M - 1), greater<int>());
ans = X[M - 1] - X[0];
for (int i = 0; i < N - 1; i++) {
ans -= d[i];
}
} else {
ans = 0;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
int main() {
int N, M, X[100000];
int d[100000], ans;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N < M) {
sort(X, X + M);
for (int i = 0; i < M - 1; i++) {
d[i] = X[i + 1] - X[i];
}
sort(d, d + (M - 1), greater<int>());
ans = X[M - 1] - X[0];
for (int i = 0; i < N - 1; i++) {
ans -= d[i];
}
} else {
ans = 0;
}
cout << ans << endl;
return 0;
} | replace | 5 | 7 | 5 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m), xs(m - 1);
rep(i, m) cin >> x[i];
sort(all(x));
rep(i, m - 1) { xs[i] = x[i + 1] - x[i]; }
sort(rall(xs));
cout << accumulate(xs.begin() + n - 1, xs.end(), 0) << endl;
;
return 0;
}
| #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n, m;
cin >> n >> m;
if (m <= n) {
cout << 0 << endl;
return 0;
}
vector<int> x(m), xs(m - 1);
rep(i, m) cin >> x[i];
sort(all(x));
rep(i, m - 1) { xs[i] = x[i + 1] - x[i]; }
sort(rall(xs));
cout << accumulate(xs.begin() + n - 1, xs.end(), 0) << endl;
;
return 0;
}
| insert | 14 | 14 | 14 | 18 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M), B(M - 1);
long long V;
for (int X = 0; X < M; X++) {
cin >> A[X];
}
sort(A.begin(), A.end());
V = A[M - 1] - A[0];
for (int X = 0; X < M; X++) {
if (X != 0) {
B[X - 1] = A[X] - A[X - 1];
}
}
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
for (int X = 0; X < N - 1; X++) {
V -= B[X];
}
cout << V << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M), B(M - 1);
long long V = 0;
if (N >= M) {
cout << 0 << endl;
return 0;
}
for (int X = 0; X < M; X++) {
cin >> A[X];
}
sort(A.begin(), A.end());
V = A[M - 1] - A[0];
for (int X = 0; X < M; X++) {
if (X != 0) {
B[X - 1] = A[X] - A[X - 1];
}
}
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
for (int X = 0; X < N - 1; X++) {
V -= B[X];
}
cout << V << endl;
} | replace | 6 | 7 | 6 | 11 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++)
cin >> X.at(i);
sort(X.begin(), X.end());
int kyori = X.at(M - 1) - X.at(0);
if (M == 1) {
cout << 0 << endl;
} else {
vector<int> sa(M - 1);
for (int i = 0; i < M - 1; i++) {
sa.at(i) = X.at(i + 1) - X.at(i);
}
sort(sa.begin(), sa.end());
int minos = 0;
for (int i = 0; i < N - 1; i++) {
minos += sa.at(M - 2 - i);
}
cout << kyori - minos << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++)
cin >> X.at(i);
sort(X.begin(), X.end());
int kyori = X.at(M - 1) - X.at(0);
if (M == 1 || N >= M) {
cout << 0 << endl;
} else {
vector<int> sa(M - 1);
for (int i = 0; i < M - 1; i++) {
sa.at(i) = X.at(i + 1) - X.at(i);
}
sort(sa.begin(), sa.end());
int minos = 0;
for (int i = 0; i < N - 1; i++) {
minos += sa.at(M - 2 - i);
}
cout << kyori - minos << endl;
}
} | replace | 12 | 13 | 12 | 13 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> X;
for (int i = 0; i < M; i++) {
int t;
std::cin >> t;
X.push_back(t);
}
std::sort(X.begin(), X.end());
int pos_min = X.at(0);
int pos_max = X.at(X.size() - 1);
int ans = pos_max - pos_min;
std::vector<int> margins;
for (int i = 1; i < X.size(); i++)
margins.push_back(X.at(i) - X.at(i - 1));
std::sort(margins.begin(), margins.end());
std::reverse(margins.begin(), margins.end());
for (int i = 0; i < N - 1; i++)
ans -= margins.at(i);
std::cout << ans << std::endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> X;
for (int i = 0; i < M; i++) {
int t;
std::cin >> t;
X.push_back(t);
}
if (N > M) {
std::cout << 0 << std::endl;
return 0;
}
std::sort(X.begin(), X.end());
int pos_min = X.at(0);
int pos_max = X.at(X.size() - 1);
int ans = pos_max - pos_min;
std::vector<int> margins;
for (int i = 1; i < X.size(); i++)
margins.push_back(X.at(i) - X.at(i - 1));
std::sort(margins.begin(), margins.end());
std::reverse(margins.begin(), margins.end());
for (int i = 0; i < N - 1; i++)
ans -= margins.at(i);
std::cout << ans << std::endl;
return 0;
}
| insert | 13 | 13 | 13 | 18 | 0 | |
p03137 | C++ | Runtime Error | /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// const ll MAX_N = 1e5;
// ll N;
// ll h[MAX_N];
// ll dp[MAX_N+1]; // メモ化テーブル
// // i番目以降の品物から重さの総和がj以下になるように選ぶ
// void rec(ll i){
// if (i==0) dp[i] = 0;
// else if (i==1) dp[i] = abs(h[1]-h[0]);
// else dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]));
// return;
// }
int main() {
// 入力
ll N, M;
cin >> N >> M;
ll X[M];
for (ll i = 0; i < M; ++i)
cin >> X[i];
// 解法
sort(X, X + M);
ll gap[M];
if (M > 1) {
REP(i, M - 1) { gap[i] = X[i + 1] - X[i]; }
}
// REP(i,M) printf("%lld ", X[i]);printf("\n");
// REP(i,M-1) printf("%lld ", gap[i]);printf("\n");
sort(gap, gap + M - 1, greater<ll>());
ll ans = 0;
ans = X[M - 1] - X[0];
// cout << ans<<endl;
if (N > 1)
REP(i, N - 1) ans -= gap[i];
if (N >= M)
cout << 0 << endl;
else
cout << ans << endl;
}
| /*
オーダー
10**6 余裕を持って間に合う
10**7 おそらく間に合う 余裕を持って間に合う
10**8 非常にシンプルな処理でない限り厳しい おそらく間に合う
10**9 非常にシンプルな処理でない限り厳しい
logn :OK
n :10^7
nlogn :10^6
n**2 :10^4
n**3 :300
2**n :20
n! :10
// 各桁の和を計算する関数
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
sort(a, a + N, greater<int>()); // a[0:N] を大きい順にソート
int num[110] = {0}; // バケット
for (int i = 0; i < N; ++i) {
num[d[i]]++; // d[i] が 1 個増える
}
map<string, int> mp; // 連想配列 map<キー型, 値型> オブジェクト名
for (int i = 0; i < N; ++i) {
auto itr = mp.find(s[i]); // s[i] が設定されているか？
if(itr != mp.end() ) {
mp[s[i]] += 1;
}
else {
mp[s[i]] += 1 ;
}
}
stack<int> s; //intをデータとするスタックを用意
s.push(1); //{} -> {1}
printf("%d\n", s.top()); // 3
s.pop();
queue<int> que; //intをデータとするキューを用意
que.push(1); //{} -> {1}
printf("%d\n", que.front()); // 1
que.pop();
*/
#include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define pb push_back // vectorに要素追加
#define INF (ll)1e18
// int
// // 各桁の和を計算する関数
// int findSumOfDigits(int n) {
// int amari = 0;
// int keta = 0;
// while (n > 0) { // n が 0 になるまで
// amari += n % 2;
// if (keta%2==0)
// n /= 10;
// }
// return sum;
// }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// const ll MAX_N = 1e5;
// ll N;
// ll h[MAX_N];
// ll dp[MAX_N+1]; // メモ化テーブル
// // i番目以降の品物から重さの総和がj以下になるように選ぶ
// void rec(ll i){
// if (i==0) dp[i] = 0;
// else if (i==1) dp[i] = abs(h[1]-h[0]);
// else dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]));
// return;
// }
int main() {
// 入力
ll N, M;
cin >> N >> M;
ll X[M];
for (ll i = 0; i < M; ++i)
cin >> X[i];
// 解法
sort(X, X + M);
ll gap[M];
if (M > 1) {
REP(i, M - 1) { gap[i] = X[i + 1] - X[i]; }
}
// REP(i,M) printf("%lld ", X[i]);printf("\n");
// REP(i,M-1) printf("%lld ", gap[i]);printf("\n");
sort(gap, gap + M - 1, greater<ll>());
ll ans = 0;
ans = X[M - 1] - X[0];
// cout << ans<<endl;
if (N > 1 & N < M)
REP(i, N - 1) ans -= gap[i];
if (N >= M)
cout << 0 << endl;
else
cout << ans << endl;
}
| replace | 126 | 127 | 126 | 127 | 0 | |
p03137 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; i++)
cin >> X.at(i);
sort(X.begin(), X.end());
vector<int> D(M - 1);
for (int i = 0; i < M - 1; i++)
D.at(i) = X.at(i + 1) - X.at(i);
sort(D.begin(), D.end());
int ans = X.at(M - 1) - X.at(0);
for (int i = 0; i < N - 1; i++)
if (i < M + 2)
ans -= D.at(M - 2 - i);
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << 0 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; i++)
cin >> X.at(i);
sort(X.begin(), X.end());
vector<int> D(M - 1);
for (int i = 0; i < M - 1; i++)
D.at(i) = X.at(i + 1) - X.at(i);
sort(D.begin(), D.end());
int ans = X.at(M - 1) - X.at(0);
for (int i = 0; i < N - 1; i++)
if (i <= M - 2)
ans -= D.at(M - 2 - i);
cout << ans << endl;
return 0;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x[m], dx[m + 1];
REP(i, m) cin >> x[i];
sort(x, x + m);
if (m == 1) {
cout << 0 << endl;
return 0;
}
FOR(i, 1, m) dx[i] = x[i] - x[i - 1];
sort(dx + 1, dx + m, greater<int>());
ll sum = x[m - 1] - x[0];
FOR(i, 1, n) { sum -= dx[i]; }
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x[m], dx[m + 1];
REP(i, m) cin >> x[i];
sort(x, x + m);
if (m == 1 || n >= m) {
cout << 0 << endl;
return 0;
}
FOR(i, 1, m) dx[i] = x[i] - x[i - 1];
sort(dx + 1, dx + m, greater<int>());
ll sum = x[m - 1] - x[0];
FOR(i, 1, n) { sum -= dx[i]; }
cout << sum << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define ll long long
using namespace std;
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, m;
cin >> n >> m;
vector<ll> xl(m);
rep(i, m) { cin >> xl[i]; }
sort(xl.begin(), xl.end());
vector<ll> dist;
rep(i, m) {
if (i + 1 >= xl.size())
break;
dist.push_back(abs(xl[i + 1] - xl[i]));
}
sort(dist.begin(), dist.end());
ll ans = 0;
if (dist.size() >= 1) {
rep(i, dist.size() - (n - 1)) { ans += dist[i]; }
}
cout << ans << endl;
// cout << fixed << setprecision(10) << ans << endl;
system("pause");
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define ll long long
using namespace std;
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1000000000000000000;
const ll MOD = 1e9 + 7;
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
int main() {
int n, m;
cin >> n >> m;
vector<ll> xl(m);
rep(i, m) { cin >> xl[i]; }
sort(xl.begin(), xl.end());
vector<ll> dist;
rep(i, m) {
if (i + 1 >= xl.size())
break;
dist.push_back(abs(xl[i + 1] - xl[i]));
}
sort(dist.begin(), dist.end());
ll ans = 0;
if (dist.size() >= 1) {
rep(i, dist.size()) {
ll last = dist.size() - (n - 1);
if (last < 0)
break;
if (i >= last)
break;
ans += dist[i];
}
}
cout << ans << endl;
// cout << fixed << setprecision(10) << ans << endl;
system("pause");
}
| replace | 58 | 59 | 58 | 66 | 0 | sh: 1: pause: not found
|
p03137 | C++ | Runtime Error | #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;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n, m;
int x[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x, x + m);
vector<int> gap;
for (int i = 0; i + 1 < m; i++) {
gap.push_back(x[i + 1] - x[i]);
}
sort(gap.begin(), gap.end());
for (int i = 0; i < n - 1; i++) {
gap.pop_back();
}
int res = std::accumulate(gap.begin(), gap.end(), 0);
out(res);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n, m;
int x[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x, x + m);
vector<int> gap;
for (int i = 0; i + 1 < m; i++) {
gap.push_back(x[i + 1] - x[i]);
}
sort(gap.begin(), gap.end());
for (int i = 0; i < n - 1 && !gap.empty(); i++) {
gap.pop_back();
}
int res = std::accumulate(gap.begin(), gap.end(), 0);
out(res);
return 0;
}
| replace | 32 | 33 | 32 | 33 | 0 | |
p03137 | C++ | Runtime Error | #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;
} | replace | 42 | 43 | 42 | 43 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; ++i)
cin >> x[i];
if (m == 1) {
cout << 0;
} else {
vector<int> y(m - 1);
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; ++i) {
y[i] = x[i + 1] - x[i];
}
sort(y.begin(), y.end());
long long ans = accumulate(y.begin(), y.end() - n + 1, 0);
cout << ans;
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; ++i)
cin >> x[i];
if ((m == 1) || (n >= m)) {
cout << 0;
} else {
vector<int> y(m - 1);
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; ++i) {
y[i] = x[i + 1] - x[i];
}
sort(y.begin(), y.end());
long long ans = accumulate(y.begin(), y.end() - n + 1, 0);
cout << ans;
}
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> x(M);
for (int i = 0; i < M; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
// Mが1のときの例外処理をいれるよう
if (M == 1) {
cout << "0" << endl;
return 0;
}
vector<int> x_(M - 1);
for (int i = 0; i < M - 1; i++) { // これで差分が代入される
x_[i] = x[i + 1] - x[i];
}
// 差分をソート、小さい順
sort(x_.begin(), x_.end());
// 大きいほうの差分N-1個は無視できる
int sum = accumulate(x_.begin(), x_.end() - (N - 1), 0);
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> x(M);
for (int i = 0; i < M; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
// Mが1のときの例外処理をいれるよう
if (M == 1) {
cout << "0" << endl;
return 0;
}
vector<int> x_(M - 1);
for (int i = 0; i < M - 1; i++) { // これで差分が代入される
x_[i] = x[i + 1] - x[i];
}
// 差分をソート、小さい順
sort(x_.begin(), x_.end());
// 大きいほうの差分N-1個は無視できる
// このときN>Mなら
if (N > M) {
cout << "0" << endl;
return 0;
}
int sum = accumulate(x_.begin(), x_.end() - (N - 1), 0);
cout << sum;
return 0;
} | insert | 24 | 24 | 24 | 29 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
vector<int> diff(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (n >= m) {
cout << 0 << endl;
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
diff[i] = abs(x[i] - x[i + 1]);
}
sort(diff.begin(), diff.end());
reverse(diff.begin(), diff.end());
diff.erase(diff.begin(), diff.begin() + n - 1);
int sum = 0;
for (int i = 0; i < m - n; i++) {
sum += diff[i];
}
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
vector<int> diff(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (n >= m) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
diff[i] = abs(x[i] - x[i + 1]);
}
sort(diff.begin(), diff.end());
reverse(diff.begin(), diff.end());
diff.erase(diff.begin(), diff.begin() + n - 1);
int sum = 0;
for (int i = 0; i < m - n; i++) {
sum += diff[i];
}
cout << sum << endl;
return 0;
}
| insert | 18 | 18 | 18 | 19 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; ++i)
cin >> x[i];
sort(x.begin(), x.end());
vector<int> dis(m - 1);
for (int i = 1; i < m; ++i)
dis[i - 1] = x[i] - x[i - 1];
sort(dis.rbegin(), dis.rend());
int res = x.back() - x[0];
for (int i = 0; i < min(m, n - 1); ++i)
res -= dis[i];
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; ++i)
cin >> x[i];
sort(x.begin(), x.end());
vector<int> dis(m - 1);
for (int i = 1; i < m; ++i)
dis[i - 1] = x[i] - x[i - 1];
sort(dis.rbegin(), dis.rend());
int res = x.back() - x[0];
for (int i = 0; i < min(m - 1, n - 1); ++i)
res -= dis[i];
cout << res << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (m != 1) {
vector<long long> x(m);
vector<long long> dx(m, 0);
for (long long i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
for (long long i = 1; i < m; i++) {
dx.at(i) = abs(x.at(i) - x.at(i - 1));
}
sort(dx.begin(), dx.end(), greater<long long>());
for (long long i = 0; i < (n - 1); i++) {
dx.at(i) = 0;
}
long long sum = 0;
for (long long i = 0; i < m; i++) {
sum += dx.at(i);
}
cout << sum << endl;
} else {
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (m != 1) {
vector<long long> x(m);
vector<long long> dx(m, 0);
for (long long i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
for (long long i = 1; i < m; i++) {
dx.at(i) = abs(x.at(i) - x.at(i - 1));
}
sort(dx.begin(), dx.end(), greater<long long>());
if (m >= (n - 1)) {
for (long long i = 0; i < (n - 1); i++) {
dx.at(i) = 0;
}
} else {
for (long long i = 0; i < m; i++) {
dx.at(i) = 0;
}
}
long long sum = 0;
for (long long i = 0; i < m; i++) {
sum += dx.at(i);
}
cout << sum << endl;
} else {
cout << 0 << endl;
}
}
| replace | 25 | 27 | 25 | 33 | 0 | |
p03137 | C++ | Runtime Error | #include <iostream>
#include <math.h>
// #include <numeric>
#include <algorithm>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, n) for (int i = 0; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> x;
rep(i, m) {
int tmp;
cin >> tmp;
x.push_back(tmp);
}
sort(x.begin(), x.end());
vector<ll> d(m);
rep(i, m - 1) { d[i] = x[i + 1] - x[i]; }
ll ans = x.back() - x.front();
sort(d.rbegin(), d.rend());
rep(i, n - 1) { ans -= d[i]; }
cout << ans << endl;
}
| #include <iostream>
#include <math.h>
// #include <numeric>
#include <algorithm>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define n_max 100000
#define rep(i, n) for (int i = 0; i < n; i++)
#define in(a) cin >> a
#define out(a) cout << a << endl
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> x;
rep(i, m) {
int tmp;
cin >> tmp;
x.push_back(tmp);
}
sort(x.begin(), x.end());
vector<ll> d(m);
rep(i, m - 1) { d[i] = x[i + 1] - x[i]; }
ll ans = x.back() - x.front();
sort(d.rbegin(), d.rend());
if (n >= m) {
ans = 0;
} else {
rep(i, n - 1) { ans -= d[i]; }
}
cout << ans << endl;
}
| replace | 35 | 36 | 35 | 41 | 0 | |
p03137 | C++ | Runtime Error | // https://atcoder.jp/contests/abc117/tasks/abc117_c
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
int main() {
int n, m, tmp;
vector<int> v, w;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end());
// 座標の差分を計算
for (int i = 1; i < m; i++) {
w.push_back(v[i] - v[i - 1]);
}
sort(w.begin(), w.end());
int sum = 0;
for (int i = 0; i < w.size() - (n - 1); i++) {
sum += w[i];
}
cout << sum << endl;
return 0;
}
| // https://atcoder.jp/contests/abc117/tasks/abc117_c
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
int main() {
int n, m, tmp;
vector<int> v, w;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end());
// 座標の差分を計算
for (int i = 1; i < m; i++) {
w.push_back(v[i] - v[i - 1]);
}
sort(w.begin(), w.end());
int sum = 0, wsize = w.size();
for (int i = 0; i < wsize - (n - 1); i++) {
sum += w[i];
}
cout << sum << endl;
return 0;
}
| replace | 27 | 29 | 27 | 29 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define INF 100000000
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> space(M - 1);
for (int i = 0; i < M - 1; i++) {
space[i] = X[i + 1] - X[i];
}
sort(space.begin(), space.end());
for (int i = 0; i < N - 1; i++) {
space.pop_back();
}
cout << accumulate(space.begin(), space.end(), 0);
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define INF 100000000
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
int main() {
int N, M;
cin >> N >> M;
if (N > M) {
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> space(M - 1);
for (int i = 0; i < M - 1; i++) {
space[i] = X[i + 1] - X[i];
}
sort(space.begin(), space.end());
for (int i = 0; i < N - 1; i++) {
space.pop_back();
}
cout << accumulate(space.begin(), space.end(), 0);
} | insert | 12 | 12 | 12 | 16 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
swap(n, m);
vector<ll> arr(n), delta;
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
for (int i = 1; i < n; i++) {
delta.push_back(arr[i] - arr[i - 1]);
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
sort(delta.begin(), delta.end());
ll max_x = arr.back() - arr.front(), max_delta = 0;
for (int i = 0; i < m - 1; i++) {
max_delta += delta.back();
delta.pop_back();
}
cout << max_x - max_delta << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
swap(n, m);
vector<ll> arr(n), delta;
for (int i = 0; i < n; i++)
cin >> arr[i];
sort(arr.begin(), arr.end());
for (int i = 1; i < n; i++) {
delta.push_back(arr[i] - arr[i - 1]);
}
if (n <= m) {
cout << 0 << endl;
return 0;
}
sort(delta.begin(), delta.end());
ll max_x = arr.back() - arr.front(), max_delta = 0;
for (int i = 0; i < m - 1; i++) {
max_delta += delta.back();
delta.pop_back();
}
cout << max_x - max_delta << endl;
return 0;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> pil;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int maxN = 5e2 + 5;
const ll INF = 1ll << 60;
int n, m;
ll a[maxN];
ll b[maxN];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%lld", &a[i]);
}
sort(a + 1, a + 1 + m);
b[0] = 0;
for (int i = 2; i <= m; i++) {
ll x = a[i] - a[i - 1];
b[i] = x;
}
sort(b + 1, b + 1 + m);
reverse(b + 1, b + 1 + m);
ll ans = 0;
for (int i = n; i <= m; i++) {
ans += b[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, ll> pil;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
const int maxN = 5e5 + 5;
const ll INF = 1ll << 60;
int n, m;
ll a[maxN];
ll b[maxN];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
scanf("%lld", &a[i]);
}
sort(a + 1, a + 1 + m);
b[0] = 0;
for (int i = 2; i <= m; i++) {
ll x = a[i] - a[i - 1];
b[i] = x;
}
sort(b + 1, b + 1 + m);
reverse(b + 1, b + 1 + m);
ll ans = 0;
for (int i = n; i <= m; i++) {
ans += b[i];
}
cout << ans << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int X[M];
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
vector<int> sub;
int ans = 0;
if (M > 1 && M < N) {
for (int i = 0; i < M - 1; i++) {
sub.push_back(X[i + 1] - X[i]);
}
std::sort(sub.begin(), sub.end());
for (int i = 0; i < sub.size() - N + 1; i++) {
ans += sub[i];
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int X[M];
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
vector<int> sub;
int ans = 0;
if (M > 1 && M > N) {
for (int i = 0; i < M - 1; i++) {
sub.push_back(X[i + 1] - X[i]);
}
std::sort(sub.begin(), sub.end());
for (int i = 0; i < sub.size() - N + 1; i++) {
ans += sub[i];
}
}
cout << ans << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int n, m, a[100005], b[100005], ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a[i];
}
sort(a + 1, a + m + 1);
for (int i = 1; i < m; i++) {
b[i] = a[i + 1] - a[i];
}
sort(b + 1, b + m);
ans = a[m] - a[1];
for (int i = m - 1; i > m - n; i--) {
ans -= b[i];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int n, m, a[100005], b[100005], ans;
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> a[i];
}
if (n >= m) {
cout << 0 << endl;
return 0;
}
sort(a + 1, a + m + 1);
for (int i = 1; i < m; i++) {
b[i] = a[i + 1] - a[i];
}
sort(b + 1, b + m);
ans = a[m] - a[1];
for (int i = m - 1; i > m - n; i--) {
ans -= b[i];
}
cout << ans << endl;
return 0;
} | insert | 11 | 11 | 11 | 15 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define sz size()
#define all(A) A.begin(), A.end()
#define mem(a, b) \
memset(a, b, sizeof(a)) // all elements of A are b=0 or b=-1 else don't work
#define f0(i, b) for (ll i = 0; i < (b); i++)
#define f1(i, b) for (ll i = 1; i <= (b); i++)
#define f2(i, a, b) for (ll i = (a); i <= (b); i++)
#define f3(i, b, a) for (ll i = (b); i >= (a); i--)
#define rep(i, a, b, c) for (ll i = (a); i != (b); i += (c))
#define MOD 1000000007 // 10^9 + 7
#define PI acos(-1.0)
#define MAX3(a, b, c) max(a, max(b, c))
/*------------------------Bitmask-------------------------------*/
#define bitOn(N, pos) (N | (1LL << (pos)))
#define bitOff(N, pos) (N & (~(1LL << (pos))))
#define bitCheck(N, pos) ((bool)(N & (1LL << (pos))))
#define bitFlip(a, k) (a ^ (1LL << (k)))
#define whilee(i, t) while (i != t)
#define sl(a) scanf("%lld", &a)
#define pl(a) printf("%lld\n", a)
// x = 1e18 means 10^18
// for(auto it =A.begin(); it!=A.end(); it++)
// sort(A.begin(),A.end()); //sort(A, +n, greater<int>());
// binary_search(A.begin(),A.end(),x);
// reverse(A.begin(), A.end());
// cout << *max_element(A.begin(), A.end()); //will have index if A.begin() is
// minus from it cout << *min_element(A.begin(), A.end()); count(A.begin(),
// A.end(), X); //counts the occurrences of X distance(A.begin(),A.end());
// //distance between first to last element accumulate(A.begin(), A.end(), 0);
// //add next_permutation(A.begin(), A.end()); prev_permutation(A.begin(),
// A.end()); swap(S[0], T[0]);
// scanf("%lld",&x);
// printf("%lld\n",x);
// printf("%I64d\n", a);
// while (scanf("%lld %lld", &a, &b) == 2)
// printf("Case %lld: %lld\n", t++, a);
/*----------------------- Graph Moves---------------------------*/
// int dx[] = {1,-1,0,0} , dy[] = {0,0,1,-1}; // 4 Direction
// int dx[] = {0,0,1,-1,-1,1,-1,1} , dy[] = {-1,1,0,0,1,1-1,-1}; // 8 Direction
// // Kings Move int dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] =
// {2,2,-2,-2,1,-1,1,-1}; // Knight Direction int dx[] = {2,-2,1,1,-1,-1} ,
// dy[] = {0,0,1,-1,1,-1}; // Hexagonal Direction
vector<ll> A, X;
// deque <ll> A;
// queue <ll> A;
// stack <ll> A;
// list <int> A;
// set <ll> A;
// map <ll,ll> A;
// unordered_map <ll, ll> A;
// pair <ll,ll> A ;
// tuple <ll, ll, ll> A;
// vector <pair <ll,ll>> A;
// bitset<32> bset1;
// bool ok = true;
// char ch;
// string S, T, U;
ll i = 0, j = 0, k = 0, a, b, c, d, e, f, g, h, l, m, n, o, p, q, r, s, t = 1,
u, v, w, x, y, z, maxx = INT_MIN, minn = INT_MAX, ans = 0, sum = 0, flag = 0,
cnt = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); // NULL
cout.tie(nullptr); // NULL
// while(cin>>n){}
cin >> n >> m;
f0(i, m) {
cin >> x;
A.pb(x);
}
sort(all(A));
f1(i, m - 1) { X.pb(abs(A[i] - A[i - 1])); }
sort(all(X));
ans = 0;
f0(i, A.sz - n) { ans += X[i]; }
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define sz size()
#define all(A) A.begin(), A.end()
#define mem(a, b) \
memset(a, b, sizeof(a)) // all elements of A are b=0 or b=-1 else don't work
#define f0(i, b) for (ll i = 0; i < (b); i++)
#define f1(i, b) for (ll i = 1; i <= (b); i++)
#define f2(i, a, b) for (ll i = (a); i <= (b); i++)
#define f3(i, b, a) for (ll i = (b); i >= (a); i--)
#define rep(i, a, b, c) for (ll i = (a); i != (b); i += (c))
#define MOD 1000000007 // 10^9 + 7
#define PI acos(-1.0)
#define MAX3(a, b, c) max(a, max(b, c))
/*------------------------Bitmask-------------------------------*/
#define bitOn(N, pos) (N | (1LL << (pos)))
#define bitOff(N, pos) (N & (~(1LL << (pos))))
#define bitCheck(N, pos) ((bool)(N & (1LL << (pos))))
#define bitFlip(a, k) (a ^ (1LL << (k)))
#define whilee(i, t) while (i != t)
#define sl(a) scanf("%lld", &a)
#define pl(a) printf("%lld\n", a)
// x = 1e18 means 10^18
// for(auto it =A.begin(); it!=A.end(); it++)
// sort(A.begin(),A.end()); //sort(A, +n, greater<int>());
// binary_search(A.begin(),A.end(),x);
// reverse(A.begin(), A.end());
// cout << *max_element(A.begin(), A.end()); //will have index if A.begin() is
// minus from it cout << *min_element(A.begin(), A.end()); count(A.begin(),
// A.end(), X); //counts the occurrences of X distance(A.begin(),A.end());
// //distance between first to last element accumulate(A.begin(), A.end(), 0);
// //add next_permutation(A.begin(), A.end()); prev_permutation(A.begin(),
// A.end()); swap(S[0], T[0]);
// scanf("%lld",&x);
// printf("%lld\n",x);
// printf("%I64d\n", a);
// while (scanf("%lld %lld", &a, &b) == 2)
// printf("Case %lld: %lld\n", t++, a);
/*----------------------- Graph Moves---------------------------*/
// int dx[] = {1,-1,0,0} , dy[] = {0,0,1,-1}; // 4 Direction
// int dx[] = {0,0,1,-1,-1,1,-1,1} , dy[] = {-1,1,0,0,1,1-1,-1}; // 8 Direction
// // Kings Move int dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] =
// {2,2,-2,-2,1,-1,1,-1}; // Knight Direction int dx[] = {2,-2,1,1,-1,-1} ,
// dy[] = {0,0,1,-1,1,-1}; // Hexagonal Direction
vector<ll> A, X;
// deque <ll> A;
// queue <ll> A;
// stack <ll> A;
// list <int> A;
// set <ll> A;
// map <ll,ll> A;
// unordered_map <ll, ll> A;
// pair <ll,ll> A ;
// tuple <ll, ll, ll> A;
// vector <pair <ll,ll>> A;
// bitset<32> bset1;
// bool ok = true;
// char ch;
// string S, T, U;
ll i = 0, j = 0, k = 0, a, b, c, d, e, f, g, h, l, m, n, o, p, q, r, s, t = 1,
u, v, w, x, y, z, maxx = INT_MIN, minn = INT_MAX, ans = 0, sum = 0, flag = 0,
cnt = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); // NULL
cout.tie(nullptr); // NULL
// while(cin>>n){}
cin >> n >> m;
f0(i, m) {
cin >> x;
A.pb(x);
}
sort(all(A));
f1(i, m - 1) { X.pb(abs(A[i] - A[i - 1])); }
sort(all(X));
ans = 0;
j = A.sz - n;
f0(i, j) { ans += X[i]; }
cout << ans << endl;
return 0;
}
| replace | 104 | 105 | 104 | 106 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
#define vvint(vec, n, m, l) vector<vector<int>> vec(n, vector<int>(m, l));
#define vvll(vec, n, m, l) vector<vector<ll>> vec(n, vector<ll>(m, l));
#define vint vector<int>;
#define pint pair<int, int>;
#define rep(i, a) for (int i = 0; i < (a); i++)
#define all(x) (x).begin(), (x).end()
#define debug system("pause")
#define ret return 0
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> x(m + 2);
rep(i, m) { cin >> x[i]; }
x[m] = INF;
x[m + 1] = -INF;
sort(x.begin(), x.end());
vector<ll> suki(m + 1);
for (int i = 1; i <= m + 1; i++) {
suki[i - 1] = x[i] - x[i - 1];
}
sort(suki.begin(), suki.end(), greater<int>());
ll ans = 0;
for (int i = 0; i < n + 1; i++) {
ans += suki[i];
}
cout << 2 * INF - ans << endl;
ret;
} | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
typedef int itn;
const ll LINF = 1e18;
const int INF = 1e8;
using namespace std;
#define vvint(vec, n, m, l) vector<vector<int>> vec(n, vector<int>(m, l));
#define vvll(vec, n, m, l) vector<vector<ll>> vec(n, vector<ll>(m, l));
#define vint vector<int>;
#define pint pair<int, int>;
#define rep(i, a) for (int i = 0; i < (a); i++)
#define all(x) (x).begin(), (x).end()
#define debug system("pause")
#define ret return 0
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> x(m + 2);
rep(i, m) { cin >> x[i]; }
x[m] = INF;
x[m + 1] = -INF;
sort(x.begin(), x.end());
vector<ll> suki(m + 1);
for (int i = 1; i <= m + 1; i++) {
suki[i - 1] = x[i] - x[i - 1];
}
sort(suki.begin(), suki.end(), greater<int>());
ll ans = 0;
for (int i = 0; i < min(n + 1, m + 1); i++) {
ans += suki[i];
}
cout << 2 * INF - ans << endl;
ret;
} | replace | 46 | 47 | 46 | 47 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int ans[6];
int main() {
int n, m;
cin >> n >> m;
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<int> v(m);
vector<int> tmp(m - 1);
rep(i, m) { cin >> v[i]; }
sort(v.begin(), v.end());
ll ans = 0;
rep(i, m - 1) {
ans += abs(v[i] - v[i + 1]);
tmp[i] = abs(v[i] - v[i + 1]);
}
sort(all(tmp));
reverse(all(tmp));
rep(i, n - 1) { ans -= tmp[i]; }
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, a, b) for (int i = a; i < (b); ++i)
#define mREP(i, a, b) for (int i = a; i > (b); --i)
#define all(x) (x).begin(), (x).end()
const int INF = 1000000007;
typedef long long ll;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int ans[6];
int main() {
int n, m;
cin >> n >> m;
if (m < n)
n = m;
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<int> v(m);
vector<int> tmp(m - 1);
rep(i, m) { cin >> v[i]; }
sort(v.begin(), v.end());
ll ans = 0;
rep(i, m - 1) {
ans += abs(v[i] - v[i + 1]);
tmp[i] = abs(v[i] - v[i + 1]);
}
sort(all(tmp));
reverse(all(tmp));
rep(i, n - 1) { ans -= tmp[i]; }
cout << ans << endl;
}
| insert | 27 | 27 | 27 | 29 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#include <vector>
#define int long long
#define ll long long
#define mod 1000000007
#define MOD 1000000007
#define inf 1e17
#define rep(i, j, n) for (int i = j; i < n; i++)
#define P pair<int, int>
#define ps push_back
#define all(x) x.begin(), x.end()
double pi = 3.141592653589793;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// ここから始めよう
signed main() {
int n, m;
cin >> n >> m;
vector<int> v;
if (m == 1) {
cout << 0 << endl;
return 0;
}
rep(i, 0, m) {
int a;
cin >> a;
a += 114514;
v.ps(a);
}
sort(all(v));
vector<int> key;
int sum = v[m - 1] - v[0];
rep(i, 1, m) { key.ps(v[i] - v[i - 1]); }
sort(all(key));
reverse(all(key));
rep(i, 0, n - 1) { sum -= key[i]; }
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#include <vector>
#define int long long
#define ll long long
#define mod 1000000007
#define MOD 1000000007
#define inf 1e17
#define rep(i, j, n) for (int i = j; i < n; i++)
#define P pair<int, int>
#define ps push_back
#define all(x) x.begin(), x.end()
double pi = 3.141592653589793;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// ここから始めよう
signed main() {
int n, m;
cin >> n >> m;
vector<int> v;
if (n >= m) {
cout << 0 << endl;
return 0;
}
rep(i, 0, m) {
int a;
cin >> a;
a += 114514;
v.ps(a);
}
sort(all(v));
vector<int> key;
int sum = v[m - 1] - v[0];
rep(i, 1, m) { key.ps(v[i] - v[i - 1]); }
sort(all(key));
reverse(all(key));
rep(i, 0, n - 1) { sum -= key[i]; }
cout << sum << endl;
return 0;
}
| replace | 48 | 49 | 48 | 49 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <algorithm>
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d", &a)
#define I2(a, b) scanf("%d%d", &a, &b)
#define I3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define L(a) scanf("%lld", &a)
#define L2(a, b) scanf("%lld%lld", &a, &b)
#define L3(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define PI(a) printf("%d", a)
#define PL(a) printf("%lld", a)
#define PT(t) printf("Case %d: ", t)
#define PB push_back
#define x first
#define y second
#define xx first.first
#define xy first.second
#define yx second.first
#define yy second.second
#define SC scanf
#define PC printf
#define NL printf("\n")
#define SET(a) memset(a, 0, sizeof a)
#define SETR(a) memset(a, -1, sizeof a)
#define SZ(a) ((int)a.size()) - 1
#define f(i, a, b) for (int i = a; i <= b; i++)
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define frr(i, a, b) for (int i = a; i >= b; i--)
#define frv(i, a) for (int i = 0; i < a.size(); i++)
#define pi 2.0 * acos(0.0)
#define R(a) freopen(a, "r", stdin);
#define W(a) freopen(a, "w", stdout);
#define CB(x) __builtin_popcount(x)
#define STN(a) stringtonumber<ll>(a)
#define lol printf("BUG\n")
#define Endl "\n"
#define mk make_pair
using namespace std;
template <class T> inline T BM(T p, T e, T M) {
ll ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T mdINV(T a, T M) { return BM(a, M - 2, M); }
template <class T> inline T PW(T p, T e) {
ll ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p);
p = (p * p);
}
return (T)ret;
}
template <class T> bool ISLEFT(T a, T b, T c) {
if (((a.xx - b.xx) * (b.yy - c.yy) - (b.xx - c.xx) * (a.yy - b.yy)) < 0.0)
return 1; // Uporer dike //A,b,c, x okkher ordera sorted
else
return 0;
}
typedef pair<int, int> P;
//////////////////////////
/////////////////////////
int main() {
int n, m;
I2(n, m);
int ar[m + 2];
for (int i = 1; i <= m; i++)
I(ar[i]);
sort(ar + 1, ar + m + 1);
int ans = ar[m] - ar[1];
vector<int> a;
for (int i = 2; i <= m; i++) {
a.push_back(ar[i] - ar[i - 1]);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
for (int i = 1; i < n; i++) {
ans -= a[i - 1];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <algorithm>
#include <bits/stdc++.h>
#include <fstream>
#include <iostream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d", &a)
#define I2(a, b) scanf("%d%d", &a, &b)
#define I3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define L(a) scanf("%lld", &a)
#define L2(a, b) scanf("%lld%lld", &a, &b)
#define L3(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define PI(a) printf("%d", a)
#define PL(a) printf("%lld", a)
#define PT(t) printf("Case %d: ", t)
#define PB push_back
#define x first
#define y second
#define xx first.first
#define xy first.second
#define yx second.first
#define yy second.second
#define SC scanf
#define PC printf
#define NL printf("\n")
#define SET(a) memset(a, 0, sizeof a)
#define SETR(a) memset(a, -1, sizeof a)
#define SZ(a) ((int)a.size()) - 1
#define f(i, a, b) for (int i = a; i <= b; i++)
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define frr(i, a, b) for (int i = a; i >= b; i--)
#define frv(i, a) for (int i = 0; i < a.size(); i++)
#define pi 2.0 * acos(0.0)
#define R(a) freopen(a, "r", stdin);
#define W(a) freopen(a, "w", stdout);
#define CB(x) __builtin_popcount(x)
#define STN(a) stringtonumber<ll>(a)
#define lol printf("BUG\n")
#define Endl "\n"
#define mk make_pair
using namespace std;
template <class T> inline T BM(T p, T e, T M) {
ll ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T mdINV(T a, T M) { return BM(a, M - 2, M); }
template <class T> inline T PW(T p, T e) {
ll ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p);
p = (p * p);
}
return (T)ret;
}
template <class T> bool ISLEFT(T a, T b, T c) {
if (((a.xx - b.xx) * (b.yy - c.yy) - (b.xx - c.xx) * (a.yy - b.yy)) < 0.0)
return 1; // Uporer dike //A,b,c, x okkher ordera sorted
else
return 0;
}
typedef pair<int, int> P;
//////////////////////////
/////////////////////////
int main() {
int n, m;
I2(n, m);
int ar[m + 2];
for (int i = 1; i <= m; i++)
I(ar[i]);
sort(ar + 1, ar + m + 1);
int ans = ar[m] - ar[1];
vector<int> a;
for (int i = 2; i <= m; i++) {
a.push_back(ar[i] - ar[i - 1]);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
for (int i = 1; i < min(n, m); i++) {
ans -= a[i - 1];
}
cout << ans << endl;
return 0;
} | replace | 103 | 104 | 103 | 104 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define per(i, n) for (ll i = n - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define _GLIBCXX_DEBUG
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef long long ll;
ll MOD = 1000000007;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> x(m), xd(m - 1);
rep(i, m) cin >> x[i];
sort(all(x));
rep(i, m - 1) { xd[i] = abs(x[i + 1] - x[i]); }
sort(all(xd));
cout << accumulate(xd.begin(), xd.begin() + (xd.size() - n + 1), 0LL) << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define per(i, n) for (ll i = n - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define _GLIBCXX_DEBUG
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
typedef long long ll;
ll MOD = 1000000007;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> x(m), xd(m - 1);
rep(i, m) cin >> x[i];
sort(all(x));
rep(i, m - 1) { xd[i] = abs(x[i + 1] - x[i]); }
sort(all(xd));
ll sum = 0;
rep(i, max(0LL, m - n)) sum += xd[i];
cout << sum << endl;
}
| replace | 55 | 56 | 55 | 58 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, sum, S;
cin >> N >> M;
vector<int> X(M), Y(M - 1);
for (int i = 0; i < M; ++i)
cin >> X.at(i);
sort(X.begin(), X.end());
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());
sum = X.at(M - 1) - X.at(0);
for (int i = 0; i < N - 1; ++i)
S += Y.at(i);
cout << sum - S << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N, M, sum, S;
cin >> N >> M;
if (N >= M)
cout << 0 << endl;
else {
vector<int> X(M), Y(M - 1);
for (int i = 0; i < M; ++i)
cin >> X.at(i);
sort(X.begin(), X.end());
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());
sum = X.at(M - 1) - X.at(0);
for (int i = 0; i < N - 1; ++i)
S += Y.at(i);
cout << sum - S << endl;
}
}
| replace | 8 | 20 | 8 | 24 | 0 | |
p03137 | C++ | Runtime Error | // s配列に格納した単語を、辞書順にソートする
// sort(s.begin(), s.end());
// string t = "keyence";//で文字列入力ができる
// s.empty() //emptyなら1を出力 入っていれば0を出力
/*//ABC018-B 部分的にreverseをかける解法
int main() {
string s;
cin >> s;
int n;
cin >> n;
vector<int>a(n);
vector<int>b(n);
rep(i,n) cin>>a.at(i)>>b.at(i);
rep(i,n)a.at(i)--;
rep(i,n)b.at(i)--;
string t;
rep(i,n){
t = s;
for(int k=0;k<=b.at(i)-a.at(i);k++){
t.at(a.at(i)+k) = s.at(b.at(i)-k);
}
s = t;
}
cout << s << endl;
}
*///ABC018-B
// string s;
// cin >> s;
// cout << s.at(0) <<endl;
// cout << s.at(0)-'0' <<endl;
// Aが16？
// cout << char(i+48) <<
// endl;//なぜかaは47と得る時がある。+48で出力もaにできる。 cout << char(97) <<
// endl;//アスキーコードでaを出力
// sort(b.begin(), b.end());//bという配列を小さい方からソート
// reverse(b.begin(), b.end());//bという配列をリターン
// 10桁でdouble出力するパターン１
// printf("%.10f\n", ma);
// 10桁でdouble出力するパターン２
// cout << fixed << setprecision(10);
// cout << ma << endl;
/*01 02 03 12 13 23 と６回見ていくパターン
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
}
}
*///vector<vector<int>> data(3, vector<int>(4));//int型の2次元配列(3×4要素の)の宣言
// int64_t a;
// 10のi乗pow(10, i);
/*string s; stringでの文字列を数字型に変える方法
cin >> s;
rep(i,s.size()-2) {
int a= (s.at(i)-'0')*100 + (s.at(i+1)-'0')*10+ s.at(i+2) -'0';
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int kan_hyaku(int n) {
int kurai = 0;
for (int i = 0; i < 3; i++) {
kurai = n % 10;
n /= 10;
}
return kurai;
}
int kan_ju(int n) {
int kurai = 0;
for (int i = 0; i < 2; i++) {
kurai = n % 10;
n /= 10;
}
return kurai;
}
int kan_ichi(int n) {
int kurai = 0;
for (int i = 0; i < 1; i++) {
kurai = n % 10;
n /= 10;
}
return kurai;
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> x(m);
rep(i, m) cin >> x.at(i);
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<ll> b(m - 1);
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
b.at(i) = x.at(i + 1) - x.at(i);
}
sort(b.begin(), b.end());
reverse(b.begin(), b.end());
for (int i = 0; i < n - 1; i++) {
b.at(i) = 0;
}
ll sum = 0;
rep(i, m - 1) sum += b.at(i);
cout << sum << endl;
} | // s配列に格納した単語を、辞書順にソートする
// sort(s.begin(), s.end());
// string t = "keyence";//で文字列入力ができる
// s.empty() //emptyなら1を出力 入っていれば0を出力
/*//ABC018-B 部分的にreverseをかける解法
int main() {
string s;
cin >> s;
int n;
cin >> n;
vector<int>a(n);
vector<int>b(n);
rep(i,n) cin>>a.at(i)>>b.at(i);
rep(i,n)a.at(i)--;
rep(i,n)b.at(i)--;
string t;
rep(i,n){
t = s;
for(int k=0;k<=b.at(i)-a.at(i);k++){
t.at(a.at(i)+k) = s.at(b.at(i)-k);
}
s = t;
}
cout << s << endl;
}
*///ABC018-B
// string s;
// cin >> s;
// cout << s.at(0) <<endl;
// cout << s.at(0)-'0' <<endl;
// Aが16？
// cout << char(i+48) <<
// endl;//なぜかaは47と得る時がある。+48で出力もaにできる。 cout << char(97) <<
// endl;//アスキーコードでaを出力
// sort(b.begin(), b.end());//bという配列を小さい方からソート
// reverse(b.begin(), b.end());//bという配列をリターン
// 10桁でdouble出力するパターン１
// printf("%.10f\n", ma);
// 10桁でdouble出力するパターン２
// cout << fixed << setprecision(10);
// cout << ma << endl;
/*01 02 03 12 13 23 と６回見ていくパターン
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
}
}
*///vector<vector<int>> data(3, vector<int>(4));//int型の2次元配列(3×4要素の)の宣言
// int64_t a;
// 10のi乗pow(10, i);
/*string s; stringでの文字列を数字型に変える方法
cin >> s;
rep(i,s.size()-2) {
int a= (s.at(i)-'0')*100 + (s.at(i+1)-'0')*10+ s.at(i+2) -'0';
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int kan_hyaku(int n) {
int kurai = 0;
for (int i = 0; i < 3; i++) {
kurai = n % 10;
n /= 10;
}
return kurai;
}
int kan_ju(int n) {
int kurai = 0;
for (int i = 0; i < 2; i++) {
kurai = n % 10;
n /= 10;
}
return kurai;
}
int kan_ichi(int n) {
int kurai = 0;
for (int i = 0; i < 1; i++) {
kurai = n % 10;
n /= 10;
}
return kurai;
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> x(m);
rep(i, m) cin >> x.at(i);
if (n > m) {
n = m;
}
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<ll> b(m - 1);
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
b.at(i) = x.at(i + 1) - x.at(i);
}
sort(b.begin(), b.end());
reverse(b.begin(), b.end());
for (int i = 0; i < n - 1; i++) {
b.at(i) = 0;
}
ll sum = 0;
rep(i, m - 1) sum += b.at(i);
cout << sum << endl;
} | insert | 88 | 88 | 88 | 91 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
vector<int> d(m - 1);
for (int i = 0; i < m - 1; i++) {
d[i] = x[i + 1] - x[i];
}
sort(d.begin(), d.end());
ll ans = 0;
for (int i = 0; i < d.size() - (n - 1); i++) {
ans += d[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
vector<int> d(m - 1);
for (int i = 0; i < m - 1; i++) {
d[i] = x[i + 1] - x[i];
}
sort(d.begin(), d.end());
ll ans = 0;
for (int i = 0; i < (int)d.size() - (n - 1); i++) {
ans += d[i];
}
cout << ans << endl;
return 0;
} | replace | 23 | 24 | 23 | 24 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
vector<int> dist(m - 1);
rep(i, m - 1) dist[i] = x[i + 1] - x[i];
sort(dist.begin(), dist.end(), greater<int>());
ll ans = accumulate(dist.begin(), dist.end(), 0);
rep(i, n - 1) ans -= dist[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
vector<int> dist(m - 1);
rep(i, m - 1) dist[i] = x[i + 1] - x[i];
sort(dist.begin(), dist.end(), greater<int>());
ll ans = accumulate(dist.begin(), dist.end(), 0);
int cnt = min(n - 1, m - 1);
rep(i, cnt) ans -= dist[i];
cout << ans << endl;
return 0;
} | replace | 25 | 26 | 25 | 27 | 0 | |
p03137 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
#define OUT(P) cout << (P) << endl
#define OUT2(P1, P2) cout << (P1) << " " << (P2) << endl
#define PRINT_ARRAY(P) \
for (int i = 0; i < P.size(); i++) \
cout << P[i] << endl;
#define PRINT_ARRAY_INLINE(P) \
do { \
for (int i = 0; i < P.size(); i++) \
cout << P[i] << " "; \
cout << endl; \
} while (0)
#define PRINT_ARRAY_WITH_LABEL(L, P) \
do { \
cout << L << ": "; \
PRINT_ARRAY_INLINE(P); \
cout << endl; \
} while (0)
typedef long long ll;
int sum_digits(int num);
template <class T> vector<T> copy_vector(vector<T> vec);
int gcd(int a, int b);
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<int> diff(m - 1);
for (int i = 0; i < diff.size(); i++) {
diff[i] = x[i + 1] - x[i];
}
sort(diff.begin(), diff.end());
int sum = 0;
for (int i = 0; i < diff.size() - n + 1; i++) {
sum += diff[i];
}
cout << sum << endl;
return 0;
}
/******************************/
/***** DECRARED FUNCTIONS *****/
/******************************/
int sum_digits(int num) {
int rtn = 0;
while (num != 0) {
int tmp = num % 10;
rtn += tmp;
num /= 10;
}
return rtn;
}
// vectorのコピー
template <class T> vector<T> copy_vector(vector<T> vec) {
vector<T> rtn;
rtn.reserve(vec.size());
copy(vec.begin(), vec.end(), back_inserter(rtn));
return rtn;
}
// ユークリウッドの互除法
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
| #include "bits/stdc++.h"
using namespace std;
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
#define OUT(P) cout << (P) << endl
#define OUT2(P1, P2) cout << (P1) << " " << (P2) << endl
#define PRINT_ARRAY(P) \
for (int i = 0; i < P.size(); i++) \
cout << P[i] << endl;
#define PRINT_ARRAY_INLINE(P) \
do { \
for (int i = 0; i < P.size(); i++) \
cout << P[i] << " "; \
cout << endl; \
} while (0)
#define PRINT_ARRAY_WITH_LABEL(L, P) \
do { \
cout << L << ": "; \
PRINT_ARRAY_INLINE(P); \
cout << endl; \
} while (0)
typedef long long ll;
int sum_digits(int num);
template <class T> vector<T> copy_vector(vector<T> vec);
int gcd(int a, int b);
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
if (n > m) {
cout << 0 << endl;
return 0;
}
vector<int> diff(m - 1);
for (int i = 0; i < diff.size(); i++) {
diff[i] = x[i + 1] - x[i];
}
sort(diff.begin(), diff.end());
int sum = 0;
for (int i = 0; i < diff.size() - n + 1; i++) {
sum += diff[i];
}
cout << sum << endl;
return 0;
}
/******************************/
/***** DECRARED FUNCTIONS *****/
/******************************/
int sum_digits(int num) {
int rtn = 0;
while (num != 0) {
int tmp = num % 10;
rtn += tmp;
num /= 10;
}
return rtn;
}
// vectorのコピー
template <class T> vector<T> copy_vector(vector<T> vec) {
vector<T> rtn;
rtn.reserve(vec.size());
copy(vec.begin(), vec.end(), back_inserter(rtn));
return rtn;
}
// ユークリウッドの互除法
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
| replace | 37 | 38 | 37 | 38 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 0; i <= (int)(n); i++)
using P = pair<int, int>;
using pq = priority_queue<int>;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int sum = 0;
vector<int> x(m);
rep(i, m) cin >> x[i];
pq q;
sort(x.begin(), x.end());
rep(i, m - 1) {
q.push(abs(x[i] - x[i + 1]));
sum += abs(x[i] - x[i + 1]);
}
// cout << sum;
rep(i, n - 1) {
sum -= q.top();
q.pop();
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 0; i <= (int)(n); i++)
using P = pair<int, int>;
using pq = priority_queue<int>;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int sum = 0;
vector<int> x(m);
rep(i, m) cin >> x[i];
pq q;
sort(x.begin(), x.end());
rep(i, m - 1) {
q.push(abs(x[i] - x[i + 1]));
sum += abs(x[i] - x[i + 1]);
}
// cout << sum;
rep(i, n - 1) {
if (!q.empty()) {
sum -= q.top();
q.pop();
}
}
cout << sum << endl;
return 0;
}
| replace | 22 | 24 | 22 | 26 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int getMinMove(int n, const std::vector<int> &positions) {
if (static_cast<int>(positions.size()) <= n) {
return 0;
}
auto pos_sorted = positions;
std::sort(pos_sorted.begin(), pos_sorted.end());
std::vector<int> diffs(positions.size() - 1);
for (int i = 0; i < static_cast<int>(diffs.size()); ++i) {
diffs[i] = pos_sorted[i + 1] - pos_sorted[i];
}
for (int i = 0; i < n - 1; ++i) {
auto iter = std::max_element(diffs.begin(), diffs.end());
diffs.erase(iter);
}
return std::accumulate(diffs.begin(), diffs.end(), 0);
return 0;
}
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> positions(m);
for (int i = 0; i < m; ++i) {
std::cin >> positions[i];
}
std::cout << getMinMove(n, positions) << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
int getMinMove(int n, const std::vector<int> &positions) {
if (static_cast<int>(positions.size()) <= n) {
return 0;
}
auto pos_sorted = positions;
std::sort(pos_sorted.begin(), pos_sorted.end());
std::vector<int> diffs(positions.size() - 1);
for (int i = 0; i < static_cast<int>(diffs.size()); ++i) {
diffs[i] = pos_sorted[i + 1] - pos_sorted[i];
}
std::sort(diffs.begin(), diffs.end());
return std::accumulate(diffs.begin(), diffs.end() - (n - 1), 0);
}
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> positions(m);
for (int i = 0; i < m; ++i) {
std::cin >> positions[i];
}
std::cout << getMinMove(n, positions) << std::endl;
return 0;
}
| replace | 15 | 21 | 15 | 17 | TLE | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x[n];
for (int i = 0; i < m; ++i)
cin >> x[i];
if (n >= m) {
cout << 0 << '\n';
return 0;
}
sort(x, x + m);
priority_queue<int> pq;
for (int i = 0; i < m - 1; ++i) {
pq.push(x[i + 1] - x[i]);
}
int ans = x[m - 1] - x[0];
while (!pq.empty() && n != 1) {
int diff = pq.top();
pq.pop();
ans -= diff;
n--;
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int x[m];
for (int i = 0; i < m; ++i)
cin >> x[i];
if (n >= m) {
cout << 0 << '\n';
return 0;
}
sort(x, x + m);
priority_queue<int> pq;
for (int i = 0; i < m - 1; ++i) {
pq.push(x[i + 1] - x[i]);
}
int ans = x[m - 1] - x[0];
while (!pq.empty() && n != 1) {
int diff = pq.top();
pq.pop();
ans -= diff;
n--;
}
cout << ans << '\n';
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
const ll mininf = -922337203685477;
const ll nax = 1e5 + 5;
ll n, m, arr[nax], ans = 0;
vector<ll> v;
bool cmp(ll a, ll b) { return a > b; }
int main() {
IOS cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> arr[i];
}
sort(arr, arr + m);
for (int i = 1; i < m; i++) {
v.pb(arr[i] - arr[i - 1]);
ans += arr[i] - arr[i - 1];
}
if (v.empty()) {
cout << 0 << '\n';
return 0;
}
sort(v.rbegin(), v.rend());
for (int i = 0; i < n - 1; i++) {
ans -= v[i];
}
if (ans < 0) {
cout << 0 << '\n';
return 0;
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(); \
cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9 + 7;
const ll inf = 0x3f3f3f3f;
const ll mininf = -922337203685477;
const ll nax = 1e5 + 5;
ll n, m, arr[nax], ans = 0;
vector<ll> v;
bool cmp(ll a, ll b) { return a > b; }
int main() {
IOS cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> arr[i];
}
if (n >= m) {
cout << 0 << '\n';
return 0;
}
sort(arr, arr + m);
for (int i = 1; i < m; i++) {
v.pb(arr[i] - arr[i - 1]);
ans += arr[i] - arr[i - 1];
}
if (v.empty()) {
cout << 0 << '\n';
return 0;
}
sort(v.rbegin(), v.rend());
for (int i = 0; i < n - 1; i++) {
ans -= v[i];
}
if (ans < 0) {
cout << 0 << '\n';
return 0;
}
cout << ans << '\n';
}
| insert | 27 | 27 | 27 | 31 | 0 | |
p03137 | C++ | Runtime Error | #include <stdio.h>
int N, M;
int X[100000], D[99999];
void merge_sort(int *a, int n) {
if (n == 1)
return;
int m = n / 2;
merge_sort(a, m);
merge_sort(a + m, n - m);
static int a_[100000];
for (int i = 0; i < n; i++) {
a_[i] = a[i];
}
int i = 0;
int j = m;
int k = 0;
while (i < m || j < n) {
if (j == n || (i < m && a_[i] <= a_[j])) {
a[k++] = a_[i++];
} else {
a[k++] = a_[j++];
}
}
}
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++) {
scanf("%d", &X[i]);
}
merge_sort(X, M);
int ans = 0;
for (int i = 0; i + 1 < M; i++) {
D[i] = X[i + 1] - X[i];
ans += D[i];
}
merge_sort(D, M - 1);
int k = M - 2;
while (k >= 0 && N >= 2) {
ans -= D[k--];
N--;
}
printf("%d\n", ans);
return 0;
}
| #include <stdio.h>
int N, M;
int X[100000], D[99999];
void merge_sort(int *a, int n) {
if (n <= 1)
return;
int m = n / 2;
merge_sort(a, m);
merge_sort(a + m, n - m);
static int a_[100000];
for (int i = 0; i < n; i++) {
a_[i] = a[i];
}
int i = 0;
int j = m;
int k = 0;
while (i < m || j < n) {
if (j == n || (i < m && a_[i] <= a_[j])) {
a[k++] = a_[i++];
} else {
a[k++] = a_[j++];
}
}
}
int main() {
scanf("%d %d", &N, &M);
for (int i = 0; i < M; i++) {
scanf("%d", &X[i]);
}
merge_sort(X, M);
int ans = 0;
for (int i = 0; i + 1 < M; i++) {
D[i] = X[i + 1] - X[i];
ans += D[i];
}
merge_sort(D, M - 1);
int k = M - 2;
while (k >= 0 && N >= 2) {
ans -= D[k--];
N--;
}
printf("%d\n", ans);
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int M = 0;
int N;
cin >> N;
cin >> M;
vector<int> A(M, 0);
if (M == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < M; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
ll ans = A.at(M - 1) - A.at(0);
// cout << ans << endl;
for (int i = 0; i < M - 1; i++) {
A.at(i) = A.at(i + 1) - A.at(i);
}
A.at(M - 1) = 0;
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
for (int i = 0; i < N - 1; i++) {
// cout << A.at(i) << endl;
ans -= A.at(i);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int M = 0;
int N;
cin >> N;
cin >> M;
vector<int> A(M, 0);
if (M == 1 || N >= M) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < M; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
ll ans = A.at(M - 1) - A.at(0);
// cout << ans << endl;
for (int i = 0; i < M - 1; i++) {
A.at(i) = A.at(i + 1) - A.at(i);
}
A.at(M - 1) = 0;
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
for (int i = 0; i < N - 1; i++) {
// cout << A.at(i) << endl;
ans -= A.at(i);
}
cout << ans << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
sort(x.begin(), x.end());
priority_queue<int> q;
rep(i, m - 1) {
int a = x[i + 1] - x[i];
q.push(a);
}
rep(i, n - 1) { q.pop(); }
int ans = 0;
while (!q.empty()) {
ans += q.top();
q.pop();
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
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());
priority_queue<int> q;
rep(i, m - 1) {
int a = x[i + 1] - x[i];
q.push(a);
}
rep(i, n - 1) { q.pop(); }
int ans = 0;
while (!q.empty()) {
ans += q.top();
q.pop();
}
cout << ans << endl;
return 0;
} | insert | 14 | 14 | 14 | 18 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
int ans = x[m - 1] - x[0];
if (m == 1)
cout << ans << endl;
else {
vector<int> dif(m - 1);
for (int i = 0; i < m - 1; i++)
dif[i] = x[i + 1] - x[i];
sort(dif.begin(), dif.end());
reverse(dif.begin(), dif.end());
for (int i = 0; i < n - 1; i++) {
ans -= dif[i];
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
int ans = x[m - 1] - x[0];
if (m == 1)
cout << ans << endl;
else {
vector<int> dif(m - 1);
for (int i = 0; i < m - 1; i++)
dif[i] = x[i + 1] - x[i];
sort(dif.begin(), dif.end());
reverse(dif.begin(), dif.end());
for (int i = 0; i < n - 1 && i < m; i++) {
ans -= dif[i];
}
cout << ans << endl;
}
} | replace | 25 | 26 | 25 | 26 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
/*
int find(int x, vector<int> &p) {
if (p[x] == x)return x;
return p[x] = find(p[x], p);
}
void uni(int x, int y, vector<int> &p) {
x = find(x, p);
y = find(y, p);
p[x] = y;
}
int same(int x, int y, vector<int> p) {
if (find(x, p) == find(y, p))return 1;
return 0;
}
*/
// long long a[1002];
int main() {
long long N, M, cnt = 0, tmp, ans = 0;
cin >> N >> M;
vector<long long> X(M), D(M - 1);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
long long sum = X[M - 1] - X[0];
for (int i = 0; i < M - 1; i++) {
D[i] = X[i + 1] - X[i];
}
sort(D.begin(), D.end());
for (int i = 0; i < N - 1; i++) {
sum -= D[M - 2 - i];
if (sum <= 0) {
sum = 0;
break;
}
}
cout << sum;
char qq;
cin >> qq;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
/*
int find(int x, vector<int> &p) {
if (p[x] == x)return x;
return p[x] = find(p[x], p);
}
void uni(int x, int y, vector<int> &p) {
x = find(x, p);
y = find(y, p);
p[x] = y;
}
int same(int x, int y, vector<int> p) {
if (find(x, p) == find(y, p))return 1;
return 0;
}
*/
// long long a[1002];
int main() {
long long N, M, cnt = 0, tmp, ans = 0;
cin >> N >> M;
vector<long long> X(M), D(M - 1);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
long long sum = X[M - 1] - X[0];
for (int i = 0; i < M - 1; i++) {
D[i] = X[i + 1] - X[i];
}
sort(D.begin(), D.end());
for (int i = 0; i < N - 1; i++) {
if (M - 2 - i < 0) {
sum = 0;
break;
}
sum -= D[M - 2 - i];
if (sum <= 0) {
sum = 0;
break;
}
}
cout << sum;
char qq;
cin >> qq;
return 0;
} | insert | 48 | 48 | 48 | 52 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> x(M);
for (int i = 0; i < M; i++) {
cin >> x[i];
}
if (M <= N) {
cout << 0 << endl;
}
sort(x.begin(), x.end());
vector<int> xsub(M - 1);
for (int i = 0; i < M - 1; i++) {
xsub[i] = x[i + 1] - x[i];
}
sort(xsub.begin(), xsub.end(), greater<int>());
int length = x[M - 1] - x[0];
for (int i = 0; i < N - 1; i++) {
length -= xsub[i];
}
cout << length << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> x(M);
for (int i = 0; i < M; i++) {
cin >> x[i];
}
if (M <= N) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
vector<int> xsub(M - 1);
for (int i = 0; i < M - 1; i++) {
xsub[i] = x[i + 1] - x[i];
}
sort(xsub.begin(), xsub.end(), greater<int>());
int length = x[M - 1] - x[0];
for (int i = 0; i < N - 1; i++) {
length -= xsub[i];
}
cout << length << endl;
return 0;
}
| insert | 15 | 15 | 15 | 16 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <climits>
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define srep(i, begin, end) for (__typeof(end) i = begin; i != end; i++)
#define si(x) int x = scanInt();
#define sll(x) LL x = scanLong();
#define sci(x) \
int x; \
scanf("%d", &x);
#define scll(x) \
LL x; \
scanf("%lld", &x);
#define pi(x) printf("%d ", x)
#define pll(x) printf("%lld ", x)
#define nl printf("\n")
#define clr(a) memset(a, 0, sizeof(a))
#define PB push_back
#define MP make_pair
using namespace std;
typedef unsigned int UI; // 32 bit integer
typedef long int LI; // 32 bit integer
typedef unsigned long int ULI; // 32 bit unsigned integer
typedef long long int LL; // 64 bit integer
typedef unsigned long long int ULL; // 64 bit unsigned integer
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
LL mod = 1e9 + 7;
/* Fast I/O */
inline int scanInt() {
int n = 0;
char ch = getchar();
int sign = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
sign = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
n = (n << 1) + (n << 3) + (int)(ch - '0');
ch = getchar();
}
return n * sign;
}
inline LL scanLong() {
LL n = 0;
char ch = getchar();
LL sign = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
sign = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
n = (n << 1) + (n << 3) + (LL)(ch - '0');
ch = getchar();
}
return n * sign;
}
int main() {
sll(n);
sll(m);
LL cns[m];
rep(i, 0, m) cns[i] = scanLong();
sort(cns, cns + m);
VLL diffs;
rep(i, 1, m) diffs.push_back(cns[i] - cns[i - 1]);
sort(diffs.begin(), diffs.end());
LL ans = cns[n - 1] - cns[0];
LL cnt = 0;
rep(i, (LL)diffs.size(), 0ll) {
if (cnt + 1 == n)
break;
ans -= diffs[i];
cnt++;
}
pll(ans);
nl;
} | #include <bits/stdc++.h>
#include <climits>
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define srep(i, begin, end) for (__typeof(end) i = begin; i != end; i++)
#define si(x) int x = scanInt();
#define sll(x) LL x = scanLong();
#define sci(x) \
int x; \
scanf("%d", &x);
#define scll(x) \
LL x; \
scanf("%lld", &x);
#define pi(x) printf("%d ", x)
#define pll(x) printf("%lld ", x)
#define nl printf("\n")
#define clr(a) memset(a, 0, sizeof(a))
#define PB push_back
#define MP make_pair
using namespace std;
typedef unsigned int UI; // 32 bit integer
typedef long int LI; // 32 bit integer
typedef unsigned long int ULI; // 32 bit unsigned integer
typedef long long int LL; // 64 bit integer
typedef unsigned long long int ULL; // 64 bit unsigned integer
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
LL mod = 1e9 + 7;
/* Fast I/O */
inline int scanInt() {
int n = 0;
char ch = getchar();
int sign = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
sign = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
n = (n << 1) + (n << 3) + (int)(ch - '0');
ch = getchar();
}
return n * sign;
}
inline LL scanLong() {
LL n = 0;
char ch = getchar();
LL sign = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
sign = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
n = (n << 1) + (n << 3) + (LL)(ch - '0');
ch = getchar();
}
return n * sign;
}
int main() {
sll(n);
sll(m);
LL cns[m];
rep(i, 0, m) cns[i] = scanLong();
sort(cns, cns + m);
VLL diffs;
rep(i, 1, m) diffs.push_back(cns[i] - cns[i - 1]);
sort(diffs.begin(), diffs.end());
LL ans = cns[m - 1] - cns[0];
LL cnt = 0;
rep(i, (LL)diffs.size(), 0ll) {
if (cnt + 1 == n)
break;
ans -= diffs[i];
cnt++;
}
pll(ans);
nl;
} | replace | 75 | 76 | 75 | 76 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> destinations(M);
for (int i = 0; i < M; ++i) {
cin >> destinations[i];
}
sort(destinations.begin(), destinations.end());
if (M == 1) {
cout << 0 << endl;
return 0;
}
vector<int> distances(M - 1);
for (int i = 0; i < M - 1; ++i) {
distances[i] = destinations[i + 1] - destinations[i];
}
int sum = accumulate(distances.begin(), distances.end(), 0);
sort(distances.rbegin(), distances.rend());
for (int i = 0; i < N - 1; ++i) {
sum -= distances[i];
}
cout << sum << endl;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> destinations(M);
for (int i = 0; i < M; ++i) {
cin >> destinations[i];
}
sort(destinations.begin(), destinations.end());
if (M == 1) {
cout << 0 << endl;
return 0;
}
vector<int> distances(M - 1);
for (int i = 0; i < M - 1; ++i) {
distances[i] = destinations[i + 1] - destinations[i];
}
int sum = accumulate(distances.begin(), distances.end(), 0);
sort(distances.rbegin(), distances.rend());
for (int i = 0; i < min(N - 1, M - 1); ++i) {
sum -= distances[i];
}
cout << sum << endl;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p03137 | C++ | Runtime Error | #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define M_PI acos(-1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1000000007;
const int MAX_V = 201;
int now = 0;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct edge {
int t;
edge(int _t) : t(_t) {}
};
bool use[100010];
vector<edge> te[100010];
vector<edge> fe[100010];
int t[64];
int d[100100];
int n;
void Solve() {
int m;
cin >> n >> m;
for (size_t i = 0; i < m; i++) {
cin >> t[i];
}
sort(t, t + m);
ll sum = 0;
for (size_t i = 0; i < m - 1; i++) {
d[i] = t[i + 1] - t[i];
sum += d[i];
}
sort(d, d + (m - 1));
reverse(d, d + (m - 1));
if (m <= n - 1) {
cout << 0 << endl;
return;
}
for (size_t i = 0; i < n - 1; i++) {
sum -= d[i];
}
cout << sum << endl;
}
int main() {
Solve();
return 0;
}
| #pragma once
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define M_PI acos(-1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1000000007;
const int MAX_V = 201;
int now = 0;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct edge {
int t;
edge(int _t) : t(_t) {}
};
bool use[100010];
vector<edge> te[100010];
vector<edge> fe[100010];
int t[100100];
int d[100100];
int n;
void Solve() {
int m;
cin >> n >> m;
for (size_t i = 0; i < m; i++) {
cin >> t[i];
}
sort(t, t + m);
ll sum = 0;
for (size_t i = 0; i < m - 1; i++) {
d[i] = t[i + 1] - t[i];
sum += d[i];
}
sort(d, d + (m - 1));
reverse(d, d + (m - 1));
if (m <= n - 1) {
cout << 0 << endl;
return;
}
for (size_t i = 0; i < n - 1; i++) {
sum -= d[i];
}
cout << sum << endl;
}
int main() {
Solve();
return 0;
}
| replace | 59 | 60 | 59 | 60 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int SZ = 10005;
priority_queue<int> pq;
int arr[SZ];
int main(void) {
int n, m;
scanf("%d %d", &n, &m);
n--;
for (int i = 0; i < m; i++)
scanf("%d", &arr[i]);
sort(arr, arr + m);
int ans = arr[m - 1] - arr[0];
for (int i = 1; i < m; i++) {
pq.push(arr[i] - arr[i - 1]);
}
while (!pq.empty() && n > 0) {
int t = pq.top();
pq.pop();
ans -= t;
n--;
}
printf("%d", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int SZ = 100005;
priority_queue<int> pq;
int arr[SZ];
int main(void) {
int n, m;
scanf("%d %d", &n, &m);
n--;
for (int i = 0; i < m; i++)
scanf("%d", &arr[i]);
sort(arr, arr + m);
int ans = arr[m - 1] - arr[0];
for (int i = 1; i < m; i++) {
pq.push(arr[i] - arr[i - 1]);
}
while (!pq.empty() && n > 0) {
int t = pq.top();
pq.pop();
ans -= t;
n--;
}
printf("%d", ans);
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> x(m);
vector<int> xx(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
xx[i] = x[i + 1] - x[i];
}
sort(xx.begin(), xx.end());
long long summ = 0;
for (int i = 0; i < n - 1; i++) {
summ += xx.back();
xx.pop_back();
}
cout << x[m - 1] - x[0] - summ << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> x(m);
vector<int> xx(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
xx[i] = x[i + 1] - x[i];
}
sort(xx.begin(), xx.end());
long long summ = 0;
for (int i = 0; i < n - 1; i++) {
summ += xx.back();
xx.pop_back();
if (xx.empty() == true) {
break;
}
}
cout << x[m - 1] - x[0] - summ << endl;
return 0;
} | insert | 30 | 30 | 30 | 33 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n, 0)
#define all(a) a.begin(), a.end()
#define IN(a, n) \
rep(i, n) { cin >> a[i]; }
const int vx[4] = {0, 1, 0, -1};
const int vy[4] = {1, 0, -1, 0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define int ll
int n, m;
int a[1000000];
int l[1000000];
int ans;
signed main() {
cin >> n >> m;
rep(i, m) { cin >> a[i]; }
if (n <= m) {
cout << 0 << endl;
return 0;
}
sort(a, a + m);
ans = a[m - 1] - a[0];
rep(i, m - 1) { l[i] = a[i + 1] - a[i]; }
sort(l, l + m - 1);
rep(i, n) { ans -= l[m - 1 - i]; }
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define PLL pair<ll, ll>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n, 0)
#define all(a) a.begin(), a.end()
#define IN(a, n) \
rep(i, n) { cin >> a[i]; }
const int vx[4] = {0, 1, 0, -1};
const int vy[4] = {1, 0, -1, 0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define int ll
int n, m;
int a[1000000];
int l[1000000];
int ans;
signed main() {
cin >> n >> m;
rep(i, m) { cin >> a[i]; }
if (n >= m) {
cout << 0 << endl;
return 0;
}
sort(a, a + m);
ans = a[m - 1] - a[0];
rep(i, m - 1) { l[i] = a[i + 1] - a[i]; }
sort(l, l + m - 1);
rep(i, n) { ans -= l[m - 1 - i]; }
cout << ans << endl;
}
| replace | 33 | 34 | 33 | 34 | 0 | |
p03137 | C++ | Runtime Error | #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;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll n, m;
cin >> n >> m;
vl x(m);
rep(i, m) cin >> x[i];
sort(all(x));
if (m == 1)
cout << 0 << endl;
else {
vl y(m - 1);
rep(i, m - 1) y[i] = x[i + 1] - x[i];
sort(y.rbegin(), y.rend());
rep(i, min(n - 1, m)) y[i] = 0;
ll sum = 0;
rep(i, m - 1) sum += y[i];
cout << sum << endl;
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define INF 1 << 30
#define LINF (ll)1 << 62
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> P;
typedef vector<pair<ll, ll>> vpl;
int main() {
ll n, m;
cin >> n >> m;
vl x(m);
rep(i, m) cin >> x[i];
sort(all(x));
if (m == 1)
cout << 0 << endl;
else {
vl y(m - 1);
rep(i, m - 1) y[i] = x[i + 1] - x[i];
sort(y.rbegin(), y.rend());
rep(i, min(n - 1, m - 1)) y[i] = 0;
ll sum = 0;
rep(i, m - 1) sum += y[i];
cout << sum << endl;
}
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> pl;
typedef double db;
typedef string str;
typedef vector<str> vs;
#define in(x) cin >> x
#define ini(x) \
int x; \
cin >> x
#define inl(x) \
ll x; \
cin >> x
#define ins(x) \
str s; \
cin >> x
#define out(x) cout << x
#define outb(x) cout << x << ' '
#define outn(x) cout << x << '\n'
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz size()
#define len length()
#define all(x) x.begin(), x.end()
#define alln(a, n) a, a + n
#define forn(i, s, e) for (int i = s; i < e; i++)
#define forr(i, s, e) for (int i = s; i >= e; i--)
#define ford(i, s, e, d) for (int i = s; i < e; i += d)
#define fors(i, n) for (int i = 1; i * i <= n; i++)
const int MAX = (int)1e5 + 9;
int arr[MAX];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ini(n);
ini(m);
forn(i, 0, m) in(arr[i]);
sort(alln(arr, m));
int md = arr[m - 1] - arr[0];
vi d;
forn(i, 1, m) d.pb(arr[i] - arr[i - 1]);
sort(all(d));
reverse(all(d));
forn(i, 0, n - 1) md -= d[i];
outn(md);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll, ll> pl;
typedef double db;
typedef string str;
typedef vector<str> vs;
#define in(x) cin >> x
#define ini(x) \
int x; \
cin >> x
#define inl(x) \
ll x; \
cin >> x
#define ins(x) \
str s; \
cin >> x
#define out(x) cout << x
#define outb(x) cout << x << ' '
#define outn(x) cout << x << '\n'
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define sz size()
#define len length()
#define all(x) x.begin(), x.end()
#define alln(a, n) a, a + n
#define forn(i, s, e) for (int i = s; i < e; i++)
#define forr(i, s, e) for (int i = s; i >= e; i--)
#define ford(i, s, e, d) for (int i = s; i < e; i += d)
#define fors(i, n) for (int i = 1; i * i <= n; i++)
const int MAX = (int)1e5 + 9;
int arr[MAX];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ini(n);
ini(m);
forn(i, 0, m) in(arr[i]);
if (n >= m) {
outn(0);
return 0;
}
sort(alln(arr, m));
int md = arr[m - 1] - arr[0];
vi d;
forn(i, 1, m) d.pb(arr[i] - arr[i - 1]);
sort(all(d));
reverse(all(d));
forn(i, 0, n - 1) md -= d[i];
outn(md);
return 0;
}
| insert | 65 | 65 | 65 | 69 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << "0\n";
return 0;
}
vector<int> L(M);
for (int i = 0; i < M; i++) {
cin >> L[i];
}
sort(L.begin(), L.end());
vector<int> Width(M - 1);
for (int i = 0; i < M - 1; i++) {
Width[i] = L[i + 1] - L[i];
}
sort(Width.begin(), Width.end());
for (int i = 0; i < N - 1; i++) {
Width.pop_back();
}
cout << accumulate(Width.begin(), Width.end(), 0) << "\n";
}
| #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << "0\n";
return 0;
}
if (M == 1) {
cout << "0\n";
return 0;
}
vector<int> L(M);
for (int i = 0; i < M; i++) {
cin >> L[i];
}
sort(L.begin(), L.end());
vector<int> Width(M - 1);
for (int i = 0; i < M - 1; i++) {
Width[i] = L[i + 1] - L[i];
}
sort(Width.begin(), Width.end());
for (int i = 0; i < N - 1; i++) {
Width.pop_back();
}
cout << accumulate(Width.begin(), Width.end(), 0) << "\n";
}
| insert | 9 | 9 | 9 | 13 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> X(M);
for (int i = 0; i < M; i++)
cin >> X[i];
if (M == 1) {
cout << 0 << endl;
return 0;
}
sort(X.begin(), X.end());
vector<long long> Y(M - 1);
for (int i = 0; i < M - 1; i++)
Y[i] = X[i + 1] - X[i];
sort(Y.rbegin(), Y.rend());
long long ans = 0;
for (int i = 0; i < N - 1; i++)
ans += Y[i];
cout << X.back() - X.front() - ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> X(M);
for (int i = 0; i < M; i++)
cin >> X[i];
if (M == 1) {
cout << 0 << endl;
return 0;
}
sort(X.begin(), X.end());
vector<long long> Y(M - 1);
for (int i = 0; i < M - 1; i++)
Y[i] = X[i + 1] - X[i];
sort(Y.rbegin(), Y.rend());
long long ans = 0;
for (int i = 0; i < min(M - 1, N - 1); i++)
ans += Y[i];
cout << X.back() - X.front() - ans << endl;
return 0;
} | replace | 29 | 30 | 29 | 30 | 0 | |
p03137 | C++ | Runtime Error | #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<int> dist(m - 1);
for (int i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
dist[i] = x[i + 1] - x[i];
}
sort(dist.begin(), dist.end());
for (int i = 0; i < n - 1; i++) {
dist.pop_back();
}
int ans = 0;
for (int i = 0; i < dist.size(); i++) {
ans += dist[i];
}
cout << ans << endl;
} | #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<int> dist(m - 1);
for (int i = 0; i < m; i++) {
cin >> x.at(i);
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
dist[i] = x[i + 1] - x[i];
}
sort(dist.begin(), dist.end());
for (int i = 0; i < n - 1; i++) {
dist.pop_back();
}
int ans = 0;
int size = dist.size();
for (int i = 0; i < size; i++) {
ans += dist[i];
}
cout << ans << endl;
}
| replace | 24 | 25 | 24 | 26 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int const static n_max = 100000;
int n, m, x[n_max + 10], l[n_max + 10];
int main() {
cin >> n >> m;
rep(i, m) cin >> x[i];
sort(x, x + m);
for (int i = 1; i < m; i++) {
l[i - 1] = x[i] - x[i - 1];
}
sort(l, l + m - 1);
int sum = 0;
for (int i = m - 1 - 1; i > m - n - 1; i--) {
sum += l[i];
}
cout << ((x[m - 1] - x[0]) - sum) << endl;
} | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int const static n_max = 100000;
int n, m, x[n_max + 10], l[n_max + 10];
int main() {
cin >> n >> m;
rep(i, m) cin >> x[i];
if (n >= m) {
cout << 0 << endl;
return 0;
}
sort(x, x + m);
for (int i = 1; i < m; i++) {
l[i - 1] = x[i] - x[i - 1];
}
sort(l, l + m - 1);
int sum = 0;
for (int i = m - 1 - 1; i > m - n - 1; i--) {
sum += l[i];
}
cout << ((x[m - 1] - x[0]) - sum) << endl;
} | insert | 18 | 18 | 18 | 23 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
// 入力
int N, M;
cin >> N >> M;
ll x[M];
for (int i = 0; i < M; i++)
scanf("%lld", x + i);
if (M == 1) {
cout << 0 << endl;
return 0;
}
sort(x, x + M);
ll d[M - 1];
for (int i = 0; i < M - 1; i++) {
d[i] = x[i + 1] - x[i];
}
sort(d, d + (M - 1));
cout << accumulate(d, d + (M - N), 0) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
// 入力
int N, M;
cin >> N >> M;
ll x[M];
for (int i = 0; i < M; i++)
scanf("%lld", x + i);
if (N >= M) {
cout << 0 << endl;
return 0;
}
sort(x, x + M);
ll d[M - 1];
for (int i = 0; i < M - 1; i++) {
d[i] = x[i + 1] - x[i];
}
sort(d, d + (M - 1));
cout << accumulate(d, d + (M - N), 0) << endl;
return 0;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAX 10005
#define MOD 1000000007
#define INF 1e9
#define mp make_pair
using namespace std;
typedef long long ll;
int arr[MAX];
vector<int> diff;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n, k;
cin >> k >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
if (k >= n) {
cout << 0 << endl;
return 0;
}
sort(arr, arr + n);
int sum = arr[n - 1] - arr[0];
for (int i = 1; i < n; i++) {
diff.push_back(arr[i] - arr[i - 1]);
}
sort(diff.begin(), diff.end());
reverse(diff.begin(), diff.end());
for (int i = 0; i < k - 1; i++) {
sum -= diff[i];
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
#define MAX 100005
#define MOD 1000000007
#define INF 1e9
#define mp make_pair
using namespace std;
typedef long long ll;
int arr[MAX];
vector<int> diff;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int n, k;
cin >> k >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
if (k >= n) {
cout << 0 << endl;
return 0;
}
sort(arr, arr + n);
int sum = arr[n - 1] - arr[0];
for (int i = 1; i < n; i++) {
diff.push_back(arr[i] - arr[i - 1]);
}
sort(diff.begin(), diff.end());
reverse(diff.begin(), diff.end());
for (int i = 0; i < k - 1; i++) {
sum -= diff[i];
}
cout << sum << endl;
return 0;
}
| replace | 1 | 2 | 1 | 2 | 0 | |
p03137 | C++ | Runtime Error | #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;
}
} | replace | 14 | 15 | 14 | 15 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for (int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
int main() {
ll N, M;
cin >> N >> M;
vl X(M);
rep(i, M) cin >> X[i];
if (N >= M) {
cout << 0 << "\n";
return 0;
}
stable_sort(X.begin(), X.end());
vl Y(N - 1);
ll ans = 0;
rep(i, M - 1) {
Y[i] = X[i + 1] - X[i];
ans += Y[i];
}
stable_sort(Y.begin(), Y.end(), greater<ll>());
rep(i, N - 1) ans -= Y[i];
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for (int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
int main() {
ll N, M;
cin >> N >> M;
vl X(M);
rep(i, M) cin >> X[i];
if (N >= M) {
cout << 0 << "\n";
return 0;
}
stable_sort(X.begin(), X.end());
vl Y(M - 1);
ll ans = 0;
rep(i, M - 1) {
Y[i] = X[i + 1] - X[i];
ans += Y[i];
}
stable_sort(Y.begin(), Y.end(), greater<ll>());
rep(i, N - 1) ans -= Y[i];
cout << ans << "\n";
return 0;
}
| replace | 26 | 27 | 26 | 27 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p03137 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
#define N 11000
#define INF 0x3f3f3f3f
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
int a[N], dif[N];
int main() {
int n, m;
while (scanf("%d%d", &m, &n) != EOF) {
int res = 0;
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
sort(a, a + n);
for (int i = 0; i < n - 1; ++i)
dif[i] = a[i + 1] - a[i];
n = n - 1;
m = m - 1;
sort(dif, dif + n);
for (int i = 0; i < n - m; ++i)
res += dif[i];
printf("%d\n", res);
}
return 0;
}
| #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
#define N 110000
#define INF 0x3f3f3f3f
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
int a[N], dif[N];
int main() {
int n, m;
while (scanf("%d%d", &m, &n) != EOF) {
int res = 0;
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
sort(a, a + n);
for (int i = 0; i < n - 1; ++i)
dif[i] = a[i + 1] - a[i];
n = n - 1;
m = m - 1;
sort(dif, dif + n);
for (int i = 0; i < n - m; ++i)
res += dif[i];
printf("%d\n", res);
}
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
int main() {
int n, m;
int x[10000] = {};
int d[10000] = {};
int ans = 0;
cin >> n >> m;
LOOP(i, m) { cin >> x[i]; }
if (n >= m) {
cout << 0 << endl;
return 0;
}
sort(x, x + m);
LOOP(i, m - 1) { d[i] = x[i] - x[i + 1]; }
sort(d, d + m - 1);
// LOOP(i,m){
// cout << x[i] << ":" << d[i] << endl;
// }
for (int i = n - 1; i < m; i++) {
ans += d[i];
}
ans *= -1;
cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 1000000000
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define LOOP(i, N) for (int i = 0; i < N; i++)
#define LOOP1(i, N) for (int i = 1; i <= N; i++)
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
int main() {
int n, m;
int x[100000] = {};
int d[100000] = {};
int ans = 0;
cin >> n >> m;
LOOP(i, m) { cin >> x[i]; }
if (n >= m) {
cout << 0 << endl;
return 0;
}
sort(x, x + m);
LOOP(i, m - 1) { d[i] = x[i] - x[i + 1]; }
sort(d, d + m - 1);
// LOOP(i,m){
// cout << x[i] << ":" << d[i] << endl;
// }
for (int i = n - 1; i < m; i++) {
ans += d[i];
}
ans *= -1;
cout << ans;
}
| replace | 17 | 19 | 17 | 19 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = LLONG_MAX / 2;
const ll MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N, M;
cin >> N >> M;
int X[M];
for (int i = 0; i < M; i++)
cin >> X[i];
if (M == 1) {
cout << 0 << endl;
return 0;
}
sort(X, X + M);
int difX[M - 1];
for (int i = 0; i + 1 < M; i++) {
difX[i] = X[i + 1] - X[i];
}
sort(difX, difX + M - 1, greater<int>());
int ans = X[M - 1] - X[0];
for (int i = 0; i < N - 1; i++) {
ans -= difX[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = LLONG_MAX / 2;
const ll MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N, M;
cin >> N >> M;
int X[M];
for (int i = 0; i < M; i++)
cin >> X[i];
if (N >= M) {
cout << 0 << endl;
return 0;
}
sort(X, X + M);
int difX[M - 1];
for (int i = 0; i + 1 < M; i++) {
difX[i] = X[i + 1] - X[i];
}
sort(difX, difX + M - 1, greater<int>());
int ans = X[M - 1] - X[0];
for (int i = 0; i < N - 1; i++) {
ans -= difX[i];
}
cout << ans << endl;
return 0;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<int> x(m), xm(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << 0;
return 0;
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
xm[i] = x[i + 1] - x[i];
}
sort(xm.begin(), xm.end(), greater<int>());
for (int i = 0; i < n - 1; i++) {
ans += xm[i];
}
ans = x[m - 1] - x[0] - ans;
cout << ans;
return 0;
} | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<int> x(m), xm(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1 || n > m) {
cout << 0;
return 0;
}
sort(x.begin(), x.end());
for (int i = 0; i < m - 1; i++) {
xm[i] = x[i + 1] - x[i];
}
sort(xm.begin(), xm.end(), greater<int>());
for (int i = 0; i < n - 1; i++) {
ans += xm[i];
}
ans = x[m - 1] - x[0] - ans;
cout << ans;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class T, class U> using P = pair<T, U>;
template <class S, class T, class U> using TUP = tuple<S, T, U>;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using str = string;
using vll = V<ll>;
using vll2 = VV<ll>;
using vll3 = VVV<ll>;
using pll = P<ll, ll>;
using tll = TUP<ll, ll, ll>;
using vpll = V<pll>;
using tpll = V<tll>;
using vs = V<str>;
using vvs = V<vs>;
using vd = V<dbl>;
using vvd = V<vd>;
using qll = queue<ll>;
using qpll = queue<pll>;
using mapll = map<ll, ll>;
using setll = set<ll>;
#define int ll
#define fst first
#define snd second
#define PQ priority_queue
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define popb pop_back()
#define sz size()
#define bn begin()
#define ed end()
#define FOR(i, a, b) for (ll i = (a); i <= (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i >= (ll)(a); i--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define REP1(i, n) FOR(i, 1, (n))
#define VFOR(i, v) for (auto &(i) : v)
#define IOTA(a, n) \
vll(a)((n)); \
iota((a).bn, (a).ed, (0));
#define SORT_ASC(a) sort((a).bn, (a).ed)
#define SORT_DESC(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bn, (b).ed), (a).ed)
#define PREVP(a) prev_permutation((a).bn, (a).ed)
#define NEXTP(a) next_permutation((a).bn, (a).ed)
#define BINS(a, target) binary_search((a).bn, (a).ed, target)
#define LB(a, target) lower_bound((a).bn, (a).ed, target)
#define FIND(a, target) find((a).bn, (a).ed, target)
#define UB(a, target) upper_bound((a).bn, (a).ed, target)
#define CNT(a, target) count((a).bn, (a).ed, target)
#define SUM(a) accumulate((a).bn, (a).ed, 0)
#define DEBUG(...) \
dal(#__VA_ARGS__); \
dal(__VA_ARGS__)
#define Dig2(a, b) ((a) >> (b)&1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (dbl)(b))))) % 10)
#define DigN2(a) ((llabs(a) == 0) ? 1 : ((ll)log2((dbl)llabs(a)) + 1))
#define DigN10(a) ((llabs(a) == 0) ? 1 : ((ll)log10((dbl)llabs(a)) + 1))
#define Pow2(a) ((ll)(1) << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & -(a))
#define llin(n) \
ll n; \
cin >> n;
#define strin(n) \
str n; \
cin >> n;
#define vin(v) \
VFOR(i, v) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vl4in(v1, v2, N) \
vll(v1)(N), (v2)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i]; };
#define vl6in(v1, v2, v3, N) \
vll(v1)(N), (v2)(N), (v3)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i] >> (v3)[i]; };
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define min(...) Min(__VA_ARGS__)
#define max(...) Max(__VA_ARGS__)
#define emin(a, ...) ((a) = Min((a), __VA_ARGS__))
#define emax(a, ...) ((a) = Max((a), __VA_ARGS__))
#define egcd(a, ...) ((a) = gcd((a), __VA_ARGS__))
#define elcm(a, ...) ((a) = lcm((a), __VA_ARGS__))
#define tf(cond, t, f) \
if (cond) { \
echo(t); \
} else { \
echo(f); \
}
#define yn(cond) tf(cond, "yes", "no")
#define Yn(cond) tf(cond, "Yes", "No")
#define YN(cond) tf(cond, "YES", "NO")
static const ll MOD = (ll)1e9 + 7;
static const ll INF = (1LL << 62) - 1; // 4.611E+18
static const dbl PI = acos(-1.0);
void Input(){};
template <class T, class... Args> void Input(T &t, Args &...args) {
cin >> t;
Input(args...);
}
void vInit(ll size) {}
template <class T, class... Args> void vInit(ll size, V<T> &v, Args &...args) {
v.resize(size);
vInit(size, args...);
}
void vInputNum(ll num) {}
template <class T, class... Args>
void vInputNum(ll num, V<T> &v, Args &...args) {
cin >> v[num];
vInputNum(num, args...);
}
void vInput(ll size) {}
template <class... Args> void vInput(ll size, Args &...args) {
vInit(size);
REP(i, size) { vInputNum(i, args...); }
}
template <class S, class T> ostream &operator<<(ostream &o, const P<S, T> &p) {
return o << "(" << p.first << ", " << p.second << ")";
}
template <class T> ostream &operator<<(ostream &o, const V<T> &v) {
if (v.empty()) {
return o << "[]";
} else {
auto itr = v.bn;
o << "[" << *itr;
itr++;
while (itr != v.ed) {
o << ", " << *itr;
itr++;
}
o << "]";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, queue<T> q) {
if (q.empty()) {
return o << "| |";
} else {
while (!q.empty()) {
o << "| " << q.front() << " ";
q.pop();
}
o << "|";
return o;
}
}
template <class S, class T>
ostream &operator<<(ostream &o, const map<S, T> &m) {
if (m.empty()) {
return o << "[]";
} else {
auto itr = m.bn;
o << "{" << itr->first << ": " << itr->second;
itr++;
while (itr != m.ed) {
o << "} {" << itr->first << ": " << itr->second;
itr++;
}
o << "}";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, const set<T> &s) {
if (s.empty()) {
return o << "<>";
} else {
auto itr = s.bn;
o << "<" << *itr;
itr++;
while (itr != s.ed) {
o << ", " << *itr;
itr++;
}
o << ">";
return o;
}
}
void say() {}
template <class T> void say(T t) { cout << t; }
template <class Head, class... Body> void say(Head h, Body... b) {
cout << h;
say(b...);
}
void echo() { cout << "\n"; }
template <class... Args> void echo(Args... args) {
say(args...);
cout << "\n";
}
void dbgsay() {}
template <class T> void dbgsay(T t) { cout << t; }
template <class Head, class... Body> void dbgsay(Head h, Body... b) {
cerr << h << " ";
dbgsay(b...);
}
void dbgecho() { cout << "\n"; }
template <class... Args> void dbgecho(Args... args) {
dbgsay(args...);
cerr << "\n";
}
void echovv() {}
template <class T> void echovv(VV<T> v) {
if (v.empty()) {
echo();
} else {
VFOR(i, v)
echo(v);
}
}
template <class T, class... Args> void echovv(VV<T> v, Args... args) {
echovv(v);
echovv(args...);
}
template <class Head> Head Min(Head head) { return head; }
template <class Head, class... Body> Head Min(Head h, Body... b) {
auto t = Min(b...);
return (h < t) ? h : t;
}
template <class Head> Head Max(Head head) { return head; }
template <class Head, class... Body> Head Max(Head h, Body... b) {
auto t = Max(b...);
return (h > t) ? h : t;
}
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
template <class... Body> ll gcd(ll h, Body... b) { return gcd(h, gcd(b...)); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class... Body> ll lcm(ll h, Body... b) { return lcm(h, lcm(b...)); }
ll Bset(ll a, ll b, ll c) {
if (c)
a |= b;
else
a &= ~b;
return a;
}
struct UF {
public:
ll tsize;
ll mode;
vll par;
vll rank;
UF(){};
UF(const UF &uf) {}
UF(ll _size, ll _mode = 0) {
tsize = _size;
mode = _mode;
par.assign(tsize, -1);
if (!mode)
rank.resize(tsize, 0);
}
ll root(ll x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool isRoot(ll x) { return root(x) == x; }
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] += x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return -par[root(x)]; }
};
class Vertex {
public:
ll idx;
ll param = -1;
ll dist = INF;
vector<pair<Vertex *, ll> /**/> e;
ll size() { return e.size(); }
bool operator==(const Vertex *o) { return dist == o->dist; }
bool operator!=(const Vertex *o) { return dist != o->dist; }
bool operator>(const Vertex *o) { return dist > o->dist; }
bool operator<(const Vertex *o) { return dist < o->dist; }
bool operator>=(const Vertex *o) { return dist >= o->dist; }
bool operator<=(const Vertex *o) { return dist <= o->dist; }
};
class Graph {
public:
vector<Vertex *> V;
vll order;
typedef tuple<Vertex *, Vertex *, ll> Edge;
vector<Edge> E;
Graph(ll siz) {
REP(i, siz) {
auto v = new Vertex();
v->idx = i;
V.pb(v);
}
}
static bool comp(const Edge &e1, const Edge &e2) {
return get<2>(e1) < get<2>(e2);
}
Vertex *getVertex(ll idx) { return V[idx]; }
void unite(ll from, ll to, ll w = 1, bool digraph = true) {
E.push_back(make_tuple(V[from], V[to], w));
V[from]->e.pb(make_pair(V[to], w));
if (!digraph) {
E.push_back(make_tuple(V[to], V[from], w));
V[to]->e.pb(make_pair(V[from], w));
}
}
void dijkstra(ll start) {
PQ<Vertex *, vector<Vertex *>, greater<Vertex *> /**/> pq;
Vertex *s = getVertex(start);
s->dist = 0;
pq.push(s);
while (!pq.empty()) {
Vertex *v = pq.top();
pq.pop();
for (auto &u : v->e) {
if (u.first->dist > v->dist + u.second) {
u.first->dist = v->dist + u.second;
pq.push(u.first);
}
}
}
}
bool sort() {
for (auto &v : V) {
if (v->param == -1 && !sort_visit(v->idx)) {
return false;
}
}
reverse(order.bn, order.ed);
return true;
}
bool sort_visit(int v) {
Vertex *_v = getVertex(v);
_v->param = 1;
if (!_v->e.empty()) {
for (auto &u : _v->e) {
if (u.first->param == 2)
continue;
if (u.first->param == 1)
return false;
if (!sort_visit(u.first->idx))
return false;
}
}
order.push_back(v);
_v->param = 2;
return true;
}
};
ll isPrime(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n)) {
if (n % i == 0)
return 0;
}
return 1;
}
ll DigS10(ll n) {
ll m = 0;
REP(i, DigN10(n)) { m += (ll)((llabs(n) % Pow10(i + 1))) / Pow10(i); }
return m;
}
ll PowMod(ll a, ll b) {
ll ans = 1, x = a % MOD;
REP(i, DigN2(b)) {
if (Dig2(b, i) == 1) {
ans = (ans * x) % MOD;
}
if (i != (DigN2(b) - 1)) {
x = (x * x) % MOD;
}
}
return ans;
}
vll FactMod(1, 1);
vll FactModInv(1, 1);
ll Mod(ll n) {
n %= MOD;
n = (n + MOD) % MOD;
return n;
}
ll InvM(ll n) {
n = Mod(n);
n = PowMod(n, MOD - 2);
return n;
}
void CFactMod(ll n) {
if (FactMod.size() <= n) {
FOR(i, FactMod.size(), n) {
FactMod.pb((FactMod[i - 1] * (i % MOD)) % MOD);
}
}
}
void CFactModInv(ll n) {
CFactMod(n);
if (FactModInv.size() < (n + 1)) {
FactModInv.resize(n + 1, -1);
}
if (FactModInv[n] == -1) {
FactModInv[n] = PowMod(FactMod[n], MOD - 2);
}
for (int i = n - 1; i >= 1; i--) {
if (FactModInv[i] != -1)
break;
FactModInv[i] = ((FactModInv[i + 1] * ((i + 1) % MOD)) % MOD);
}
}
ll CombMod(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (n + 1 > FactModInv.size())
CFactModInv(n);
return ((((FactModInv[k] * FactModInv[n - k]) % MOD) * FactMod[n]) % MOD);
}
pll factor_sub(ll n, ll m) {
ll i = 0;
while (n % m == 0) {
i++;
n /= m;
}
return mp(i, n);
}
vpll factrization(ll n) {
vpll a;
ll c, m;
tie(c, m) = factor_sub(n, 2);
if (c > 0)
a.pb(mp(2, c));
for (ll i = 3; m >= i * i; i += 2) {
tie(c, m) = factor_sub(m, i);
if (c > 0)
a.pb(mp(i, c));
}
if (m > 1)
a.pb(mp(m, 1));
return a;
}
signed main() {
llin(N);
llin(M);
vllin(X, M);
SORT_ASC(X);
vll y;
if (M == 1) {
echo(0);
return 0;
}
REP(i, M - 1) { y.pb(abs(X[i] - X[i + 1])); }
SORT_DESC(y);
FOR(i, 0, N - 2) { y.erase(y.bn + 0); }
echo(SUM(y));
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using VVV = V<VV<T>>;
template <class T, class U> using P = pair<T, U>;
template <class S, class T, class U> using TUP = tuple<S, T, U>;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using str = string;
using vll = V<ll>;
using vll2 = VV<ll>;
using vll3 = VVV<ll>;
using pll = P<ll, ll>;
using tll = TUP<ll, ll, ll>;
using vpll = V<pll>;
using tpll = V<tll>;
using vs = V<str>;
using vvs = V<vs>;
using vd = V<dbl>;
using vvd = V<vd>;
using qll = queue<ll>;
using qpll = queue<pll>;
using mapll = map<ll, ll>;
using setll = set<ll>;
#define int ll
#define fst first
#define snd second
#define PQ priority_queue
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define popb pop_back()
#define sz size()
#define bn begin()
#define ed end()
#define FOR(i, a, b) for (ll i = (a); i <= (ll)(b); i++)
#define rFOR(i, a, b) for (ll i = (b); i >= (ll)(a); i--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define REP1(i, n) FOR(i, 1, (n))
#define VFOR(i, v) for (auto &(i) : v)
#define IOTA(a, n) \
vll(a)((n)); \
iota((a).bn, (a).ed, (0));
#define SORT_ASC(a) sort((a).bn, (a).ed)
#define SORT_DESC(a) sort((a).rbegin(), (a).rend())
#define UNIQUE(a) (a).erase(unique((a).bn, (b).ed), (a).ed)
#define PREVP(a) prev_permutation((a).bn, (a).ed)
#define NEXTP(a) next_permutation((a).bn, (a).ed)
#define BINS(a, target) binary_search((a).bn, (a).ed, target)
#define LB(a, target) lower_bound((a).bn, (a).ed, target)
#define FIND(a, target) find((a).bn, (a).ed, target)
#define UB(a, target) upper_bound((a).bn, (a).ed, target)
#define CNT(a, target) count((a).bn, (a).ed, target)
#define SUM(a) accumulate((a).bn, (a).ed, 0)
#define DEBUG(...) \
dal(#__VA_ARGS__); \
dal(__VA_ARGS__)
#define Dig2(a, b) ((a) >> (b)&1)
#define Dig10(a, b) (ll)(((a) / ((ll)(pow(10.0, (dbl)(b))))) % 10)
#define DigN2(a) ((llabs(a) == 0) ? 1 : ((ll)log2((dbl)llabs(a)) + 1))
#define DigN10(a) ((llabs(a) == 0) ? 1 : ((ll)log10((dbl)llabs(a)) + 1))
#define Pow2(a) ((ll)(1) << (a))
#define Pow10(a) ((ll)(pow(10.0, double(a))))
#define LSB(a) ((a) & -(a))
#define llin(n) \
ll n; \
cin >> n;
#define strin(n) \
str n; \
cin >> n;
#define vin(v) \
VFOR(i, v) { cin >> (i); };
#define vllin(v, N) \
vll(v)((N)); \
vin(v);
#define vl4in(v1, v2, N) \
vll(v1)(N), (v2)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i]; };
#define vl6in(v1, v2, v3, N) \
vll(v1)(N), (v2)(N), (v3)(N); \
REP(i, N) { cin >> (v1)[i] >> (v2)[i] >> (v3)[i]; };
#define vsin(v, N) \
vs(v)((N)); \
vin(v);
#define min(...) Min(__VA_ARGS__)
#define max(...) Max(__VA_ARGS__)
#define emin(a, ...) ((a) = Min((a), __VA_ARGS__))
#define emax(a, ...) ((a) = Max((a), __VA_ARGS__))
#define egcd(a, ...) ((a) = gcd((a), __VA_ARGS__))
#define elcm(a, ...) ((a) = lcm((a), __VA_ARGS__))
#define tf(cond, t, f) \
if (cond) { \
echo(t); \
} else { \
echo(f); \
}
#define yn(cond) tf(cond, "yes", "no")
#define Yn(cond) tf(cond, "Yes", "No")
#define YN(cond) tf(cond, "YES", "NO")
static const ll MOD = (ll)1e9 + 7;
static const ll INF = (1LL << 62) - 1; // 4.611E+18
static const dbl PI = acos(-1.0);
void Input(){};
template <class T, class... Args> void Input(T &t, Args &...args) {
cin >> t;
Input(args...);
}
void vInit(ll size) {}
template <class T, class... Args> void vInit(ll size, V<T> &v, Args &...args) {
v.resize(size);
vInit(size, args...);
}
void vInputNum(ll num) {}
template <class T, class... Args>
void vInputNum(ll num, V<T> &v, Args &...args) {
cin >> v[num];
vInputNum(num, args...);
}
void vInput(ll size) {}
template <class... Args> void vInput(ll size, Args &...args) {
vInit(size);
REP(i, size) { vInputNum(i, args...); }
}
template <class S, class T> ostream &operator<<(ostream &o, const P<S, T> &p) {
return o << "(" << p.first << ", " << p.second << ")";
}
template <class T> ostream &operator<<(ostream &o, const V<T> &v) {
if (v.empty()) {
return o << "[]";
} else {
auto itr = v.bn;
o << "[" << *itr;
itr++;
while (itr != v.ed) {
o << ", " << *itr;
itr++;
}
o << "]";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, queue<T> q) {
if (q.empty()) {
return o << "| |";
} else {
while (!q.empty()) {
o << "| " << q.front() << " ";
q.pop();
}
o << "|";
return o;
}
}
template <class S, class T>
ostream &operator<<(ostream &o, const map<S, T> &m) {
if (m.empty()) {
return o << "[]";
} else {
auto itr = m.bn;
o << "{" << itr->first << ": " << itr->second;
itr++;
while (itr != m.ed) {
o << "} {" << itr->first << ": " << itr->second;
itr++;
}
o << "}";
return o;
}
}
template <class T> ostream &operator<<(ostream &o, const set<T> &s) {
if (s.empty()) {
return o << "<>";
} else {
auto itr = s.bn;
o << "<" << *itr;
itr++;
while (itr != s.ed) {
o << ", " << *itr;
itr++;
}
o << ">";
return o;
}
}
void say() {}
template <class T> void say(T t) { cout << t; }
template <class Head, class... Body> void say(Head h, Body... b) {
cout << h;
say(b...);
}
void echo() { cout << "\n"; }
template <class... Args> void echo(Args... args) {
say(args...);
cout << "\n";
}
void dbgsay() {}
template <class T> void dbgsay(T t) { cout << t; }
template <class Head, class... Body> void dbgsay(Head h, Body... b) {
cerr << h << " ";
dbgsay(b...);
}
void dbgecho() { cout << "\n"; }
template <class... Args> void dbgecho(Args... args) {
dbgsay(args...);
cerr << "\n";
}
void echovv() {}
template <class T> void echovv(VV<T> v) {
if (v.empty()) {
echo();
} else {
VFOR(i, v)
echo(v);
}
}
template <class T, class... Args> void echovv(VV<T> v, Args... args) {
echovv(v);
echovv(args...);
}
template <class Head> Head Min(Head head) { return head; }
template <class Head, class... Body> Head Min(Head h, Body... b) {
auto t = Min(b...);
return (h < t) ? h : t;
}
template <class Head> Head Max(Head head) { return head; }
template <class Head, class... Body> Head Max(Head h, Body... b) {
auto t = Max(b...);
return (h > t) ? h : t;
}
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
template <class... Body> ll gcd(ll h, Body... b) { return gcd(h, gcd(b...)); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class... Body> ll lcm(ll h, Body... b) { return lcm(h, lcm(b...)); }
ll Bset(ll a, ll b, ll c) {
if (c)
a |= b;
else
a &= ~b;
return a;
}
struct UF {
public:
ll tsize;
ll mode;
vll par;
vll rank;
UF(){};
UF(const UF &uf) {}
UF(ll _size, ll _mode = 0) {
tsize = _size;
mode = _mode;
par.assign(tsize, -1);
if (!mode)
rank.resize(tsize, 0);
}
ll root(ll x) { return par[x] < 0 ? x : par[x] = root(par[x]); }
bool isRoot(ll x) { return root(x) == x; }
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (mode) {
par[x] += par[y];
par[y] += x;
} else {
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = y;
} else {
par[x] += par[y];
par[y] = x;
if (rank[x] == rank[y])
rank[x]++;
}
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return -par[root(x)]; }
};
class Vertex {
public:
ll idx;
ll param = -1;
ll dist = INF;
vector<pair<Vertex *, ll> /**/> e;
ll size() { return e.size(); }
bool operator==(const Vertex *o) { return dist == o->dist; }
bool operator!=(const Vertex *o) { return dist != o->dist; }
bool operator>(const Vertex *o) { return dist > o->dist; }
bool operator<(const Vertex *o) { return dist < o->dist; }
bool operator>=(const Vertex *o) { return dist >= o->dist; }
bool operator<=(const Vertex *o) { return dist <= o->dist; }
};
class Graph {
public:
vector<Vertex *> V;
vll order;
typedef tuple<Vertex *, Vertex *, ll> Edge;
vector<Edge> E;
Graph(ll siz) {
REP(i, siz) {
auto v = new Vertex();
v->idx = i;
V.pb(v);
}
}
static bool comp(const Edge &e1, const Edge &e2) {
return get<2>(e1) < get<2>(e2);
}
Vertex *getVertex(ll idx) { return V[idx]; }
void unite(ll from, ll to, ll w = 1, bool digraph = true) {
E.push_back(make_tuple(V[from], V[to], w));
V[from]->e.pb(make_pair(V[to], w));
if (!digraph) {
E.push_back(make_tuple(V[to], V[from], w));
V[to]->e.pb(make_pair(V[from], w));
}
}
void dijkstra(ll start) {
PQ<Vertex *, vector<Vertex *>, greater<Vertex *> /**/> pq;
Vertex *s = getVertex(start);
s->dist = 0;
pq.push(s);
while (!pq.empty()) {
Vertex *v = pq.top();
pq.pop();
for (auto &u : v->e) {
if (u.first->dist > v->dist + u.second) {
u.first->dist = v->dist + u.second;
pq.push(u.first);
}
}
}
}
bool sort() {
for (auto &v : V) {
if (v->param == -1 && !sort_visit(v->idx)) {
return false;
}
}
reverse(order.bn, order.ed);
return true;
}
bool sort_visit(int v) {
Vertex *_v = getVertex(v);
_v->param = 1;
if (!_v->e.empty()) {
for (auto &u : _v->e) {
if (u.first->param == 2)
continue;
if (u.first->param == 1)
return false;
if (!sort_visit(u.first->idx))
return false;
}
}
order.push_back(v);
_v->param = 2;
return true;
}
};
ll isPrime(ll n) {
if (n <= 1)
return 0;
FOR(i, 2, (ll)sqrt(n)) {
if (n % i == 0)
return 0;
}
return 1;
}
ll DigS10(ll n) {
ll m = 0;
REP(i, DigN10(n)) { m += (ll)((llabs(n) % Pow10(i + 1))) / Pow10(i); }
return m;
}
ll PowMod(ll a, ll b) {
ll ans = 1, x = a % MOD;
REP(i, DigN2(b)) {
if (Dig2(b, i) == 1) {
ans = (ans * x) % MOD;
}
if (i != (DigN2(b) - 1)) {
x = (x * x) % MOD;
}
}
return ans;
}
vll FactMod(1, 1);
vll FactModInv(1, 1);
ll Mod(ll n) {
n %= MOD;
n = (n + MOD) % MOD;
return n;
}
ll InvM(ll n) {
n = Mod(n);
n = PowMod(n, MOD - 2);
return n;
}
void CFactMod(ll n) {
if (FactMod.size() <= n) {
FOR(i, FactMod.size(), n) {
FactMod.pb((FactMod[i - 1] * (i % MOD)) % MOD);
}
}
}
void CFactModInv(ll n) {
CFactMod(n);
if (FactModInv.size() < (n + 1)) {
FactModInv.resize(n + 1, -1);
}
if (FactModInv[n] == -1) {
FactModInv[n] = PowMod(FactMod[n], MOD - 2);
}
for (int i = n - 1; i >= 1; i--) {
if (FactModInv[i] != -1)
break;
FactModInv[i] = ((FactModInv[i + 1] * ((i + 1) % MOD)) % MOD);
}
}
ll CombMod(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (n + 1 > FactModInv.size())
CFactModInv(n);
return ((((FactModInv[k] * FactModInv[n - k]) % MOD) * FactMod[n]) % MOD);
}
pll factor_sub(ll n, ll m) {
ll i = 0;
while (n % m == 0) {
i++;
n /= m;
}
return mp(i, n);
}
vpll factrization(ll n) {
vpll a;
ll c, m;
tie(c, m) = factor_sub(n, 2);
if (c > 0)
a.pb(mp(2, c));
for (ll i = 3; m >= i * i; i += 2) {
tie(c, m) = factor_sub(m, i);
if (c > 0)
a.pb(mp(i, c));
}
if (m > 1)
a.pb(mp(m, 1));
return a;
}
signed main() {
llin(N);
llin(M);
vllin(X, M);
SORT_ASC(X);
vll y;
if (M == 1 || N >= M) {
echo(0);
return 0;
}
REP(i, M - 1) { y.pb(abs(X[i] - X[i + 1])); }
SORT_DESC(y);
FOR(i, 0, N - 2) { y.erase(y.bn + 0); }
echo(SUM(y));
} | replace | 508 | 509 | 508 | 509 | 0 | |
p03137 | C++ | Runtime Error | #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;
}*/ | replace | 23 | 24 | 23 | 24 | 0 | |
p03137 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto 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 vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
// ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#define INF 1 << 30
const int mod = 998244353;
ll power(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x *= x;
p /= 2;
} else {
a *= x;
p--;
}
}
return a;
}
ll mpower(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x = x * x % mod;
p /= 2;
} else {
a = a * x % mod;
p--;
}
}
return a;
}
ll c(ll n, ll k) {
ll a = 1;
rep(i, 1, k) {
a *= n - i + 1;
a /= i;
}
return a;
}
ll mc(ll n, ll m) {
ll k = 1, l = 1;
rep(i, n - m + 1, n + 1) k = k * i % mod;
rep(i, 1, m + 1) l = l * i % mod;
l = mpower(l, mod - 2);
return k * l % mod;
}
int main() {
int n, m;
int s = 0;
cin >> n >> m;
vector<int> x(m), d(m - 1);
rep(i, 0, m) cin >> x[i];
sort(all(x));
s = x.back() - x.front();
rep(i, 0, m - 1) d[i] = x[i + 1] - x[i];
r_sort(d);
rep(i, 0, n - 1) s -= d[i];
printf("%d\n", s);
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <bitset>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (auto 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 vec_cnt(_a, _n) (upper_bound(all(_a), _n) - lower_bound(all(_a), _n))
#define vec_unique(_a) _a.erase(std::unique(all(_a)), _a.end());
ll gcd(ll a, ll b) { return a % b == 0 ? b : gcd(b, a % b); }
// ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
#define INF 1 << 30
const int mod = 998244353;
ll power(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x *= x;
p /= 2;
} else {
a *= x;
p--;
}
}
return a;
}
ll mpower(ll x, ll p) {
ll a = 1;
while (p > 0) {
if (p % 2 == 0) {
x = x * x % mod;
p /= 2;
} else {
a = a * x % mod;
p--;
}
}
return a;
}
ll c(ll n, ll k) {
ll a = 1;
rep(i, 1, k) {
a *= n - i + 1;
a /= i;
}
return a;
}
ll mc(ll n, ll m) {
ll k = 1, l = 1;
rep(i, n - m + 1, n + 1) k = k * i % mod;
rep(i, 1, m + 1) l = l * i % mod;
l = mpower(l, mod - 2);
return k * l % mod;
}
int main() {
int n, m;
int s = 0;
cin >> n >> m;
vector<int> x(m), d(m - 1);
rep(i, 0, m) cin >> x[i];
sort(all(x));
s = x.back() - x.front();
rep(i, 0, m - 1) d[i] = x[i + 1] - x[i];
r_sort(d);
n = min(n, m);
rep(i, 0, n - 1) s -= d[i];
printf("%d\n", s);
return 0;
}
| insert | 80 | 80 | 80 | 81 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> v(k);
vector<long long> dv(k - 1);
for (int i = 0; i < k; i++) {
cin >> v[i];
}
std::sort(v.begin(), v.end(), std::greater<int>());
long long max = *std::max_element(v.begin(), v.end());
long long min = *std::min_element(v.begin(), v.end());
long long suml = max - min;
long long suma = 0;
if (k == 1) {
cout << 0 << endl;
} else {
for (int i = 0; i < k - 1; i++) {
dv[i] = v[i] - v[i + 1];
}
std::sort(dv.begin(), dv.end(), std::greater<int>());
if (n == 1) {
cout << suml << endl;
} else {
for (int i = 0; i < n - 1; i++) {
suma += dv[i];
}
cout << suml - suma << endl;
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<long long> v(k);
vector<long long> dv(k - 1);
for (int i = 0; i < k; i++) {
cin >> v[i];
}
std::sort(v.begin(), v.end(), std::greater<int>());
long long max = *std::max_element(v.begin(), v.end());
long long min = *std::min_element(v.begin(), v.end());
long long suml = max - min;
long long suma = 0;
if (k == 1 || k <= n) {
cout << 0 << endl;
} else {
for (int i = 0; i < k - 1; i++) {
dv[i] = v[i] - v[i + 1];
}
std::sort(dv.begin(), dv.end(), std::greater<int>());
if (n == 1) {
cout << suml << endl;
} else {
for (int i = 0; i < n - 1; i++) {
suma += dv[i];
}
cout << suml - suma << endl;
}
}
return 0;
} | replace | 23 | 24 | 23 | 24 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (long long i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (long long i = (a); i >= (b); --i)
#define REPR(i, n) FORR(i, n, 0)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
ll n, m;
vector<ll> x, y;
cin >> n >> m;
REP(i, m) {
ll z;
cin >> z;
x.push_back(z);
}
sort(x.begin(), x.end());
REP(i, x.size() - 1) {
ll z = x[i + 1] - x[i];
y.push_back(z);
}
sort(y.begin(), y.end());
ll ans = 0;
REP(i, y.size() - n + 1) { ans += y[i]; }
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (long long i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (long long i = (a); i >= (b); --i)
#define REPR(i, n) FORR(i, n, 0)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
ll n, m;
vector<ll> x, y;
cin >> n >> m;
REP(i, m) {
ll z;
cin >> z;
x.push_back(z);
}
sort(x.begin(), x.end());
REP(i, x.size() - 1) {
ll z = x[i + 1] - x[i];
y.push_back(z);
}
sort(y.begin(), y.end());
ll ans = 0;
if (n >= m) {
cout << 0 << endl;
return 0;
}
REP(i, y.size() - n + 1) { ans += y[i]; }
cout << ans << endl;
return 0;
}
| insert | 44 | 44 | 44 | 49 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
vll r(v.size());
rep(i, v.size()) r[i] = v[i];
return r;
}
inline void input(int &v) {
v = 0;
char c = 0;
int p = 1;
while (c < '0' || c > '9') {
if (c == '-')
p = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
v = (v << 3) + (v << 1) + c - '0';
c = getchar();
}
v *= p;
} // これを使うならば、tieとかを消して！！
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
o << "(" << v.first << ", " << v.second << ")";
return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
using s = int[];
(void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
-> basic_ostream<Ch, Tr> & {
os << "(";
print_tuple(os, t, gen_seq<sizeof...(Args)>());
return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
rep(i, v.size()) {
rep(j, v[i].size()) o << v[i][j] << " ";
o << endl;
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it;
o << "]";
return o;
}
vector<int> range(const int x, const int y) {
vector<int> v(y - x + 1);
iota(v.begin(), v.end(), x);
return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
rep(j, o.size()) i >> o[j];
return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.front();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
unordered_map<T, ll> ret;
for (auto &&x : vec)
ret[x]++;
return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
ofstream ofs("./out.dot");
ofs << "digraph graph_name {" << endl;
set<P> memo;
rep(i, g.size()) rep(j, g[i].size()) {
if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
continue;
memo.insert(P(i, g[i][j]));
ofs << " " << i << " -> " << g[i][j]
<< (mode ? " [arrowhead = none]" : "") << endl;
}
ofs << "}" << endl;
ofs.close();
system(((string) "dot -T png out.dot >" + filename).c_str());
}
size_t random_seed;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
size_t operator()(argument_type const &x) const {
size_t seed = random_seed;
seed ^= hash<ll>{}(x.fi);
seed ^= (hash<ll>{}(x.se) << 1);
return seed;
}
};
}; // namespace std
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils
int main() {
ll N, M;
cin >> N >> M;
vector<ll> X(M), gap(M);
ll sum = 0;
for (ll i = 0; i < M; ++i)
cin >> X[i];
if (M == 1) {
cout << "0" << endl;
return 0;
}
sort(X.begin(), X.end());
for (ll i = 1; i < M; ++i) {
gap[i] = X[i] - X[i - 1];
sum += gap[i];
}
sort(gap.begin(), gap.end());
for (ll i = 0; i < N - 1; ++i) {
sum -= gap[M - i - 1];
}
cout << sum << endl;
} | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
// hamko utils
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repi(i, a, b) \
for (long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template <class T1, class T2> bool chmin(T1 &a, T2 b) {
return b < a && (a = b, true);
}
template <class T1, class T2> bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<ll, ll>;
using ld = long double;
using vld = vector<ld>;
using vi = vector<int>;
using vvi = vector<vi>;
vll conv(vi &v) {
vll r(v.size());
rep(i, v.size()) r[i] = v[i];
return r;
}
inline void input(int &v) {
v = 0;
char c = 0;
int p = 1;
while (c < '0' || c > '9') {
if (c == '-')
p = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
v = (v << 3) + (v << 1) + c - '0';
c = getchar();
}
v *= p;
} // これを使うならば、tieとかを消して！！
template <typename T, typename U>
ostream &operator<<(ostream &o, const pair<T, U> &v) {
o << "(" << v.first << ", " << v.second << ")";
return o;
}
template <size_t...> struct seq {};
template <size_t N, size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...> {};
template <size_t... Is> struct gen_seq<0, Is...> : seq<Is...> {};
template <class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch, Tr> &os, Tuple const &t, seq<Is...>) {
using s = int[];
(void)s{0, (void(os << (Is == 0 ? "" : ", ") << get<Is>(t)), 0)...};
}
template <class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr> &os, tuple<Args...> const &t)
-> basic_ostream<Ch, Tr> & {
os << "(";
print_tuple(os, t, gen_seq<sizeof...(Args)>());
return os << ")";
}
ostream &operator<<(ostream &o, const vvll &v) {
rep(i, v.size()) {
rep(j, v[i].size()) o << v[i][j] << " ";
o << endl;
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << '[';
rep(i, v.size()) o << v[i] << (i != v.size() - 1 ? ", " : "");
o << "]";
return o;
}
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T>
ostream &operator<<(ostream &o, const unordered_set<T> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U>
ostream &operator<<(ostream &o, const map<T, U> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it << (next(it) != m.end() ? ", " : "");
o << "]";
return o;
}
template <typename T, typename U, typename V>
ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) {
o << '[';
for (auto it = m.begin(); it != m.end(); it++)
o << *it;
o << "]";
return o;
}
vector<int> range(const int x, const int y) {
vector<int> v(y - x + 1);
iota(v.begin(), v.end(), x);
return v;
}
template <typename T> istream &operator>>(istream &i, vector<T> &o) {
rep(j, o.size()) i >> o[j];
return i;
}
template <typename T, typename S, typename U>
ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.front();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) {
auto tmp = v;
while (tmp.size()) {
auto x = tmp.top();
tmp.pop();
o << x << " ";
}
return o;
}
template <typename T> unordered_map<T, ll> counter(vector<T> vec) {
unordered_map<T, ll> ret;
for (auto &&x : vec)
ret[x]++;
return ret;
};
string substr(string s, P x) { return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll &g, int mode = 0, string filename = "out.png") {
ofstream ofs("./out.dot");
ofs << "digraph graph_name {" << endl;
set<P> memo;
rep(i, g.size()) rep(j, g[i].size()) {
if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i))))
continue;
memo.insert(P(i, g[i][j]));
ofs << " " << i << " -> " << g[i][j]
<< (mode ? " [arrowhead = none]" : "") << endl;
}
ofs << "}" << endl;
ofs.close();
system(((string) "dot -T png out.dot >" + filename).c_str());
}
size_t random_seed;
namespace std {
using argument_type = P;
template <> struct hash<argument_type> {
size_t operator()(argument_type const &x) const {
size_t seed = random_seed;
seed ^= hash<ll>{}(x.fi);
seed ^= (hash<ll>{}(x.se) << 1);
return seed;
}
};
}; // namespace std
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9 + 7)
// end of hamko utils
int main() {
ll N, M;
cin >> N >> M;
vector<ll> X(M), gap(M);
ll sum = 0;
for (ll i = 0; i < M; ++i)
cin >> X[i];
if (N >= M) {
cout << "0" << endl;
return 0;
}
sort(X.begin(), X.end());
for (ll i = 1; i < M; ++i) {
gap[i] = X[i] - X[i - 1];
sum += gap[i];
}
sort(gap.begin(), gap.end());
for (ll i = 0; i < N - 1; ++i) {
sum -= gap[M - i - 1];
}
cout << sum << endl;
} | replace | 206 | 207 | 206 | 207 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (m == 1) {
cout << 0 << '\n';
return 0;
}
if (n == 1) {
cout << a[m - 1] - a[0] << '\n';
return 0;
}
vector<int> v;
for (int i = 0; i < m - 1; i++) {
v.push_back(a[i + 1] - a[i]);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
multiset<int> largest;
for (int i = 0; i < n - 1; i++) {
largest.insert(v[i]);
}
long long ans = 0;
int start_point = 0;
for (int i = 0; i < m - 1; i++) {
if (!largest.empty()) {
if (largest.find(a[i + 1] - a[i]) != largest.end()) {
largest.erase(largest.find(a[i + 1] - a[i]));
ans += a[i] - a[start_point];
start_point = i + 1;
}
}
}
ans += a[m - 1] - a[start_point];
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (m == 1) {
cout << 0 << '\n';
return 0;
}
if (n == 1) {
cout << a[m - 1] - a[0] << '\n';
return 0;
}
vector<int> v;
for (int i = 0; i < m - 1; i++) {
v.push_back(a[i + 1] - a[i]);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
multiset<int> largest;
for (int i = 0; i < min(n - 1, (int)v.size()); i++) {
largest.insert(v[i]);
}
long long ans = 0;
int start_point = 0;
for (int i = 0; i < m - 1; i++) {
if (!largest.empty()) {
if (largest.find(a[i + 1] - a[i]) != largest.end()) {
largest.erase(largest.find(a[i + 1] - a[i]));
ans += a[i] - a[start_point];
start_point = i + 1;
}
}
}
ans += a[m - 1] - a[start_point];
cout << ans << '\n';
return 0;
} | replace | 28 | 29 | 28 | 29 | 0 | |
p03137 | C++ | Runtime Error | #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;
}
} | replace | 7 | 8 | 7 | 8 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.