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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03136 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum += vec.at(i);
}
sort(vec.begin(), vec.end());
if (vec.at(N) * 2 < sum) {
cout << "Yes" << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum += vec.at(i);
}
sort(vec.begin(), vec.end());
if (vec.at(N - 1) * 2 < sum) {
cout << "Yes" <<... | replace | 16 | 17 | 16 | 17 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p03136 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | replace | 41 | 42 | 41 | 42 | TLE | |
p03136 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += A.at(i);
}
if (sum > A.at(N)) {
cout << "Yes" << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
int sum = 0;
for (int i = 0; i < N - 1; i++) {
sum += A.at(i);
}
if (sum > A.at(N - 1)) {
cout << "Yes" << endl;
} e... | replace | 16 | 17 | 16 | 17 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p03136 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, sum(0);
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
}
sort(L.begin(), L.end());
if (sum - L[N - 1] > L[N - 1])
cout << "Yes" << endl;
else
cout << "No" << endl... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, sum(0);
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
sum += L[i];
}
sort(L.begin(), L.end());
if (sum - L[N - 1] > L[N - 1])
cout << "Yes" << endl;
else
cout << ... | insert | 7 | 7 | 7 | 8 | 0 | |
p03136 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define LAST(x) x[x.size() - 1]
#... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#pragma region Macros
#define int long long
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define LAST(x) x[x.size() - 1]
#... | replace | 43 | 44 | 43 | 44 | -11 | |
p03136 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, // change type
null_type, less<pair<int, int>>... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, // change type
null_type, less<pair<int, int>>... | replace | 28 | 29 | 28 | 29 | 0 | |
p03136 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<int> v;
int i, x;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
int c = 0;
sort(v.begin(), v.end());
for (i = 0; i < n - 1; i++)
c += v[i];
if (v[n - 1] < c)
cout << "Yes";
else
cout << "No";
retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
int i, x;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
int c = 0;
sort(v.begin(), v.end());
for (i = 0; i < n - 1; i++)
c += v[i];
if (v[n - 1] < c)
cout << "Yes";
else
cout << "... | insert | 4 | 4 | 4 | 5 | 0 | |
p03136 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max = 0;
int sum = 0;
int a[n];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max)
max = a[i];
sum += a[i];
}
if (max >= (sum - max))
cout << "No" << endl;
else
cout << "Yes" << en... | #include <iostream>
using namespace std;
int main() {
int n;
int i;
int max = 0;
int sum = 0;
int a[10];
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max)
max = a[i];
sum += a[i];
}
if (max >= (sum - max))
cout << "No" << endl;
else
cout << "Yes" << e... | replace | 9 | 10 | 9 | 10 | -11 | |
p03136 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i, N; i++)
cin >> L.at(i);
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L.at(i);
if (L.at(N - 1) >... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++)
cin >> L.at(i);
sort(L.begin(), L.end());
int sum = 0;
for (int i = 0; i < N - 1; i++)
sum += L.at(i);
if (L.at(N - 1) ... | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p03136 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int result = 0;
for (int i = 0; i < N - 1; i++) {
result += vec.at(i);
}
if (result > vec.at(N)) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int result = 0;
for (int i = 0; i < N - 1; i++) {
result += vec.at(i);
}
if (result > vec.at(N - 1)) {
cout... | replace | 19 | 20 | 19 | 20 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p03136 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> L(N);
for (int i = 1; i <= N; i++) {
cin >> L.at(i);
sum += L.at(i);
}
sort(L.begin(), L.end());
if (2 * L.at(N - 1) - sum < 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
sum += L.at(i);
}
sort(L.begin(), L.end());
if (2 * L.at(N - 1) - sum < 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 8 | 9 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p03136 | 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
... | #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
... | insert | 41 | 41 | 41 | 42 | -11 | |
p03136 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> MY(N);
for (int i = 0; i < N; i++) {
cin >> MY.at(i);
}
sort(MY.begin(), MY.end());
int k = 0;
for (int i = 0; i < N - 1; i++) {
k += MY.at(i);
}
if (k > MY.at(N)) {
cout << "Yes" << endl;
} else
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> MY(N);
for (int i = 0; i < N; i++) {
cin >> MY.at(i);
}
sort(MY.begin(), MY.end());
int k = 0;
for (int i = 0; i < N - 1; i++) {
k += MY.at(i);
}
if (k > MY.at(N - 1)) {
cout << "Yes" << endl;
} el... | replace | 15 | 16 | 15 | 16 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p03136 | Python | Runtime Error | N = int(input())
L = map(int, input().split())
if max(L) < sum(L) - max(L):
print("Yes")
else:
print("No")
| N = int(input())
L = list(map(int, input().split()))
if max(L) < sum(L) - max(L):
print("Yes")
else:
print("No")
| replace | 1 | 2 | 1 | 2 | ValueError: max() arg is an empty sequence | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03136/Python/s255983897.py", line 4, in <module>
if max(L) < sum(L) - max(L):
ValueError: max() arg is an empty sequence
|
p03136 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int max;
max = *max_element(vec.begin(), vec.end());
int total = 0;
for (int i = 0; i < N; i++) {
total += vec.at(i);
}
if (max < (total - max)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int max;
max = *max_element(vec.begin(), vec.end());
int total = 0;
for (int i = 0; i < N; i++) {
total += vec.at(i);
}
if (max < (tot... | insert | 6 | 6 | 6 | 8 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03136 | Python | Runtime Error | N = input()
L = map(int, input().split())
x = sorted(L)
Lmax = max(L)
y = x[0:-1]
ysum = sum(y)
print("Yes" if Lmax < ysum else "No")
| N = int(input())
L = list(map(int, input().split()))
x = sorted(L)
Lmax = max(L)
y = x[0:-1]
ysum = sum(y)
print("Yes" if Lmax < ysum else "No")
| replace | 0 | 2 | 0 | 2 | ValueError: max() arg is an empty sequence | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03136/Python/s642487988.py", line 4, in <module>
Lmax = max(L)
ValueError: max() arg is an empty sequence
|
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> x(m);
for (ll i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
vector<ll> y(m - 1);
for (ll i = 0; i < m - 1; i++)
y[i] = x[i + 1] - x[i];
sort(y.begin(), y.end());
ll s... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> x(m);
if (n > m) {
cout << 0;
return 0;
}
for (ll i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
vector<ll> y(m - 1);
for (ll i = 0; i < m - 1; i++)
y[i] = x[i... | insert | 8 | 8 | 8 | 12 | 0 | |
p03137 | C++ | Runtime Error | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= ... | #define NOMINMAX
#define TEST_MODE true
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#include <random>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= ... | replace | 167 | 168 | 167 | 168 | 0 | 1 2 10 12 14
|
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<int> x(m);
vector<int> max(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
if (i < m - 1)
max[i] = 0;
}
sort(x.begin(), x.end());
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<int> x(m);
vector<int> max(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
if (i < m - 1)
max[i] = 0;
}
sort(x.begin(), x.end());
... | replace | 28 | 29 | 28 | 29 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
/* #define int long long */
/* #define double long double */
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep... | #include <bits/stdc++.h>
/* #define int long long */
/* #define double long double */
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repa(i, s, n) for (int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep... | replace | 20 | 21 | 20 | 21 | 0 | |
p03137 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("avx2,tune=native")
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
if (N >= M) {
cout << '0';
exit(EXIT_SUCCESS);
}
int X[M], dist[M - 1], r... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,tune=native")
#include <bits/stdc++.h>
#include <x86intrin.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
if (N >= M) {
cout << '0';
exit(EXIT_SUCCESS);
}
int X[M], dist[M - 1], re... | replace | 1 | 2 | 1 | 2 | 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;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> X(M);
REP(i, M) cin >> X[i];
sort(X.begin(), X.end());
vector<int> D(M - 1);
REP(i, M - 1) D[i]... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<int> X(M);
REP(i, M) cin >> X[i];
sort(X.begin(), X.end());
vector<int> D(M - 1);
if (N >= M) {
... | replace | 15 | 21 | 15 | 25 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<long> X;
cin >> N >> M;
for (int i = 0; i < M; i++) {
long x;
cin >> x;
X.push_back(x);
}
sort(X.begin(), X.end());
vector<long> ivl;
for (int i = 0; i < M - 1; i++) {
ivl.push_back(X[i + 1] - X[i]);
}
sort... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
vector<long> X;
cin >> N >> M;
for (int i = 0; i < M; i++) {
long x;
cin >> x;
X.push_back(x);
}
sort(X.begin(), X.end());
vector<long> ivl;
for (int i = 0; i < M - 1; i++) {
ivl.push_back(X[i + 1] - X[i]);
}
sort... | replace | 20 | 21 | 20 | 21 | 0 | |
p03137 | C++ | Runtime Error | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < k; i++) {
cin >> a[i];
}
sort(a, a + k);
std::vector<int> v;
for (int i = 1; i < k; i++) {
... | // Author: Fuadul Hasan(fuadul202@gmail.com)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 5;
int main() {
int n, k;
cin >> n >> k;
int a[k];
for (int i = 0; i < k; i++) {
cin >> a[i];
}
sort(a, a + k);
std::vector<int> v;
for (int i = 1; i < k; i++) {
... | replace | 11 | 12 | 11 | 12 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
using namespace std;
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define MININF -1e18L
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) so... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
using namespace std;
#define PI 3.14159265358979323846
#define MAXINF 1e18L
#define MININF -1e18L
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define SORT(v) so... | insert | 43 | 43 | 43 | 48 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int input[100005];
int cache[100005];
long long ans = 0;
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++)
scanf("%d", &input[i]);
sort(input + 1, input + 1 + m);
for (int i = 1; i <= m - 1; i++) {
ans += input[i ... | #include <algorithm>
#include <cstdio>
using namespace std;
int input[100005];
int cache[100005];
long long ans = 0;
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++)
scanf("%d", &input[i]);
if (n >= m) {
printf("0\n");
return 0;
}
sort(input + 1, input + 1 + m);
f... | insert | 15 | 15 | 15 | 19 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> x(m);
rep(i, m) cin >> x[i];
sort(x.begin(), x.end());
vector<int> dif(m - 1);
... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << '\n';
return 0;
}
vector<int> x(m);
rep(i, m) cin >> x[i];
... | insert | 12 | 12 | 12 | 16 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N, M;
int main() {
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
}
vector<int> Xs(M);
for (int i = 0; i < M; i++) {
cin >> Xs.at(i);
}
sort(Xs.begin(), Xs.end());
vector<int> Ds(M - 1);
for (int i = 0; i < M - 1; i++) {
Ds.at(i) = Xs.at(... | #include <bits/stdc++.h>
using namespace std;
int N, M;
int main() {
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
vector<int> Xs(M);
for (int i = 0; i < M; i++) {
cin >> Xs.at(i);
}
sort(Xs.begin(), Xs.end());
vector<int> Ds(M - 1);
for (int i = 0; i < M - 1; i++) {
Ds.... | insert | 8 | 8 | 8 | 9 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
int ans = 0;
vector<int> X(100000, 0);
vector<int> diffX(100000, 0);
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> X[i];
}
X.erase(X.begin() + M, X.end());
diffX.erase... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int N, M;
int ans = 0;
vector<int> X(100000, 0);
vector<int> diffX(100000, 0);
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> X[i];
}
X.erase(X.begin() + M, X.end());
diffX.erase... | delete | 31 | 32 | 31 | 31 | 1 | |
p03137 | C++ | Runtime Error | #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];
}
sort(X, X + M);
int distance[M];
distance[0] = 0;
for (int i = 1; i < M; i++) {
distance[i] = X[i] - X[i - 1];
}
sort(distance, distance + M, greate... | #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];
}
sort(X, X + M);
int distance[M];
distance[0] = 0;
for (int i = 1; i < M; i++) {
distance[i] = X[i] - X[i - 1];
}
sort(distance, distance + M, greate... | replace | 21 | 22 | 21 | 22 | 0 | |
p03137 | C++ | Time Limit Exceeded | #ifdef _WIN32
#define DEBUG 1
#endif
#define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#include <fstream>
#include <iostream>
#include <string.h>
using namespace std;
#ifdef DEBUG
#include "include.h"
#else
inline void wait() {}
inline void dout(const char *arg, ...) {}
#e... | #ifdef _WIN32
#define DEBUG 1
#endif
#define _CRT_SECURE_NO_WARNINGS
#define MATH_PI 3.14159265358979323846264338327950288419716939
#include <fstream>
#include <iostream>
#include <string.h>
using namespace std;
#ifdef DEBUG
#include "include.h"
#else
inline void wait() {}
inline void dout(const char *arg, ...) {}
#e... | replace | 133 | 134 | 133 | 134 | TLE | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
... | #include <bits/stdc++.h>
using namespace std;
#define REP1(i, n) for (int i = 1, i##_len = (n); i < i##_len; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define pow(x) x *x
#define ll long long
static const ll MAX = 1000000;
static const ll INFTY = 1e12;
static const ll MOD = 1000000007;
... | replace | 60 | 63 | 60 | 64 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#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 (m == 1) {
cout << 0 << endl;
return 0;
}
sort(x.begin(), x.end());
priority_queue<int> d;
f... | #include <algorithm>
#include <iostream>
#include <queue>
#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());
priority_queue<int> d;
f... | replace | 12 | 13 | 12 | 13 | TLE | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n;
cin >> m;
int a[m];
int y[m - 1];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a, a + m);
for (int i = 0; i < n - 1; i++) {
y[i] = 0;
}
for (int i =... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n;
cin >> m;
int a[m];
int y[n - 1];
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a, a + m);
for (int i = 0; i < n - 1; i++) {
y[i] = 0;
}
for (int i =... | replace | 13 | 14 | 13 | 14 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) (int)(x.size())
#define fi first
#define se second
#define pii pair<int, int>
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
int x[m];
for (int i = 0; i < m; i++) {
cin >> x[i];
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(x) (int)(x.size())
#define fi first
#define se second
#define pii pair<int, int>
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
int x[m];
for (int i = 0; i < m; i++) {
cin >> x[i];
... | replace | 25 | 27 | 25 | 27 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i ... | insert | 81 | 81 | 81 | 82 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
// ll mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n)... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
// ll mod = 998244353;
#define rep(i, n) for (int i = 0; i < (n)... | replace | 23 | 24 | 23 | 24 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
#define MAX_N 100000
#define MAX_M 100000
template <class T, class InputIterator>
bool isin(T x, InputIterator first, InputIterator last) {
return std::any_of(first, last, [x](T y) { return x == y; });
}
int main() {
int n, m;
std::vector<int> x(MAX_M)... | #include <algorithm>
#include <iostream>
#include <vector>
#define MAX_N 100000
#define MAX_M 100000
template <class T, class InputIterator>
bool isin(T x, InputIterator first, InputIterator last) {
return std::any_of(first, last, [x](T y) { return x == y; });
}
int main() {
int n, m;
std::vector<int> x(MAX_M)... | replace | 28 | 44 | 28 | 37 | TLE | |
p03137 | C++ | Runtime Error |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
vector<int> a;
vector<int> b;
int n, x, m;
long long s;
int main() {
cin >> m >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++)
b.push_back(a[i + 1] - a[... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
vector<int> a;
vector<int> b;
int n, x, m;
long long s;
int main() {
cin >> m >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++)
b.push_back(a[i + 1] - a[... | replace | 27 | 28 | 27 | 28 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int main() {
int n, m;
cin >> n >> m... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int main() {
int n, m;
cin >> n >> m... | replace | 29 | 30 | 29 | 30 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int... | replace | 69 | 70 | 69 | 70 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> xv(m);
for (auto &x : xv) {
cin >> x;
}
if (m <= n) {
cout << 0 << endl;
} else {
sort(xv.begin(), xv.end());
vector<int> lv(m - 1);
for (int i = 1; i ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> xv(m);
for (auto &x : xv) {
cin >> x;
}
if (m <= n) {
cout << 0 << endl;
} else {
sort(xv.begin(), xv.end());
vector<int> lv(m - 1);
for (int i = 1; i ... | replace | 22 | 23 | 22 | 23 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0;... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0;... | replace | 22 | 23 | 22 | 23 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iomanip>
#define ll long long
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> X(M);
if (M != 1) {
vector<ll> d(M - 1);
for (ll i = 0; i < M; i++)
cin >> X.at(i);
sort(X.begin(), X.end());
ll ans = X.at(M - 1) - X.at(0);
for (ll i... | #include <bits/stdc++.h>
#include <iomanip>
#define ll long long
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> X(M);
if (M != 1) {
if (N < M) {
vector<ll> d(M - 1);
for (ll i = 0; i < M; i++)
cin >> X.at(i);
sort(X.begin(), X.end());
ll ans = X.at(M - ... | replace | 10 | 21 | 10 | 24 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = (x); i < (n); i++)
#define reps(i, x, n) for (int i = (x); i <= (n); i++)
#define lol long long
#define SUM(n) (((n) + 1) * (n) / 2) // 1〜nまでの総和を求める式
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) fixed << setpreci... | #include <bits/stdc++.h>
#define rep(i, x, n) for (int i = (x); i < (n); i++)
#define reps(i, x, n) for (int i = (x); i <= (n); i++)
#define lol long long
#define SUM(n) (((n) + 1) * (n) / 2) // 1〜nまでの総和を求める式
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) fixed << setpreci... | insert | 34 | 34 | 34 | 35 | TLE | |
p03137 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | replace | 147 | 148 | 147 | 148 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> pii;
const int inf = 1010001000;
const ll INF = 1001000100010001000;
const int mod = (int)1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> pii;
const int inf = 1010001000;
const ll INF = 1001000100010001000;
const int mod = (int)1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
... | replace | 19 | 20 | 19 | 20 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
const int INF = 1e9;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
#define SCIN(n) \
string(n); \
cin >> (n)
#define... | #include <bits/stdc++.h>
const int INF = 1e9;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
#define SCIN(n) \
string(n); \
cin >> (n)
#define... | insert | 40 | 40 | 40 | 44 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9 + 7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge {
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w) {}
};
using graph = vector<vector... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9 + 7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge {
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w) {}
};
using graph = vector<vector... | insert | 53 | 53 | 53 | 54 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
// #include<stdlib.h>
using namespace std;
int main() {
int n, m, a = 0;
cin >> n >> m;
vector<int> x(n);
vector<int> l(n - 1);
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <math.h>
#include <stack>
#include <string>
#include <vector>
// #include<stdlib.h>
using namespace std;
int main() {
int n, m, a = 0;
cin >> n >> m;
vector<int> x(m);
vector<int> l(m - 1);
if (m == 1) {
a = 0;
} el... | replace | 13 | 25 | 13 | 29 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M), b(M - 1);
rep(i, M) { cin >> a[i]; }
sort(a.begin(), a.end());
rep(i, M - 1) { b[i] = a[i + 1] - a[i]; }
sor... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(M), b(M - 1);
rep(i, M) { cin >> a[i]; }
if (N >= M) {
cout << 0 << endl;
} else {
sort(a.begin(), a.end()... | replace | 10 | 18 | 10 | 23 | 0 | |
p03137 | C++ | Runtime Error | #include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
... | #include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
... | replace | 55 | 56 | 55 | 56 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
... | #include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
... | replace | 61 | 62 | 61 | 62 | TLE | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, t;
long long res = 0;
cin >> N >> M;
if (M > 1) {
vector<int> v(M, 0);
vector<int> v2(M, 0);
for (int i = 0; i < M; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
res = v[M - 1] - v[0];
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, t;
long long res = 0;
cin >> N >> M;
if (M > 1) {
vector<int> v(M, 0);
vector<int> v2(M, 0);
for (int i = 0; i < M; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
res = v[M - 1] - v[0];
for (int i = 1; i <... | replace | 23 | 24 | 23 | 25 | 0 | |
p03137 | C++ | Runtime Error | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
... | // AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
// AtCoder.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#ifndef ONLINE_JUDGE
#endif
#define _USE_MATH_DEFINES
#include <math.h>
// #include<cmath>
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
... | replace | 336 | 337 | 336 | 337 | -11 | |
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 << 1 << endl;
return 0;
}
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
vector<int> sub;
... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
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> sub;
... | replace | 9 | 11 | 9 | 11 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | replace | 20 | 30 | 20 | 34 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#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];
sort(X.begin(), X.end());
vector<long long> diffs;
for (int i = 1; i < X.size(); ++i)
diffs.push_back(X[i] - X[i ... | #include <algorithm>
#include <iostream>
#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];
sort(X.begin(), X.end());
vector<long long> diffs;
for (int i = 1; i < X.size(); ++i)
diffs.push_back(X[i] - X[i ... | replace | 19 | 20 | 19 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define mod ((ull)1e9 + 7)
#define MAX ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define mod ((ull)1e9 + 7)
#define MAX ... | replace | 27 | 28 | 27 | 28 | 0 | |
p03137 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <... | insert | 34 | 34 | 34 | 39 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (m == 1) {
cout << "0";
return 0;
}
vector<long long> x(m), a(m - 1);
for (long long i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
for (long long i = m - 2; i >= 0; i--) {
a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
if (n >= m) {
cout << "0";
return 0;
}
vector<long long> x(m), a(m - 1);
for (long long i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(), x.end());
for (long long i = m - 2; i >= 0; i--) {
a[i... | replace | 6 | 7 | 6 | 7 | 0 | |
p03137 | C++ | Runtime Error | /*Code by : Harry_Singh*/
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define io ios_base::sync_with_stdio(false), cin.tie(nullptr);
#define ipair pair<int, int>
#define pb push_back
#define f(i, n) for (int i = 0; i < n; i++)
#define F(i, n) for (int i = 1; i <= n; i++)
#define FF(a, b) for (in... | /*Code by : Harry_Singh*/
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define io ios_base::sync_with_stdio(false), cin.tie(nullptr);
#define ipair pair<int, int>
#define pb push_back
#define f(i, n) for (int i = 0; i < n; i++)
#define F(i, n) for (int i = 1; i <= n; i++)
#define FF(a, b) for (in... | replace | 212 | 213 | 212 | 213 | TLE | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> x(M);
vector<ll> l(M - 1);
for (ll i = 0; i < M; i++) {
cin >> x[i];
}
sort(x.begi... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return 0;
}
vector<ll> x(M);
vector<ll> l(M - 1);
for (l... | insert | 14 | 14 | 14 | 18 | 0 | |
p03137 | C++ | Runtime Error | /* Accepted. */
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAXN 100006
int n, m;
int X[MAXN], d[MAXN], S;
int main() {
// freopen( "input","r",stdin );
cin >> m >> n;
if (m <= n)
return puts("0"), 0;
for ... | /* Accepted. */
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define MAXN 100006
int n, m;
int X[MAXN], d[MAXN], S;
int main() {
// freopen( "input","r",stdin );
cin >> m >> n;
if (n <= m)
return puts("0"), 0;
for ... | replace | 14 | 15 | 14 | 15 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
long long X[10010];
long long subX[10010];
int main(void) {
long long N, M;
cin >> N >> M;
for (long long i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
for (long long i = 0; i < M - 1; i++) {
subX[i] = X[i + 1] - X[i];
}
sor... | #include <algorithm>
#include <iostream>
using namespace std;
long long X[100100];
long long subX[100100];
int main(void) {
long long N, M;
cin >> N >> M;
for (long long i = 0; i < M; i++) {
cin >> X[i];
}
sort(X, X + M);
for (long long i = 0; i < M - 1; i++) {
subX[i] = X[i + 1] - X[i];
}
s... | replace | 5 | 7 | 5 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <queue>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
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 length = X[M - 1] - X[0];
vector<... | #include <bits/stdc++.h>
#include <queue>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int ans = 0;
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 length = X[M - 1] - X[0];
vector<... | replace | 19 | 20 | 19 | 20 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
ll N, M, ans;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
ll N, M, ans;
... | replace | 32 | 37 | 32 | 33 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fort(i, n) for (int i = 1; i <= n; ++i)
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define sz size()
#define er erase
#define fr first
#define sc second
#define rc(x) return cout << x, 0
using ... | #include <bits/stdc++.h>
#define ll long long
#define fort(i, n) for (int i = 1; i <= n; ++i)
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define sz size()
#define er erase
#define fr first
#define sc second
#define rc(x) return cout << x, 0
using ... | insert | 22 | 22 | 22 | 24 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n, m;
vector<long long int> m_v;
cin >> n >> m;
for (int i = 0; i < m; i++) {
long long int mi;
cin >> mi;
m_v.push_back(mi);
}
sort(m_v.begin(), m_v.end());
vector<long long int> di... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long int n, m;
vector<long long int> m_v;
cin >> n >> m;
if (m <= n) {
cout << 0 << endl;
return 0;
}
for (int i = 0; i < m; i++) {
long long int mi;
cin >> mi;
m_v.push_back(mi);
}
... | insert | 10 | 10 | 10 | 15 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#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];
sort(x.begin(), x.end());
vector<int> defs(m - 1);
for... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <stdio.h>
#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 (n >= m) {
cout << 0 << endl;
return 0;
}
so... | insert | 16 | 16 | 16 | 20 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M;
int d[10000];
int dis[10000];
int counter = 0;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> d[i];
}
sort(d, d + M);
for (int i = 0; i < M - 1; i++) {
dis[i] = d[i + 1] - d[i];
}
sort(dis, dis + ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M;
int d[110000];
int dis[110000];
int counter = 0;
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> d[i];
}
sort(d, d + M);
for (int i = 0; i < M - 1; i++) {
dis[i] = d[i + 1] - d[i];
}
sort(dis, dis ... | replace | 6 | 8 | 6 | 8 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | insert | 14 | 14 | 14 | 20 | 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;
} else {
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X.at(i);
}
sort(X.begin(), X.end());
int a = X.at(M - 1) - X.at(0);
vector<int> Y(M - 1);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N >= M) {
cout << "0" << endl;
} else {
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X.at(i);
}
sort(X.begin(), X.end());
int a = X.at(M - 1) - X.at(0);
vector<int> Y(M - 1);
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
vector<int> yop, yoc;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
yop.push_back(x);
}
sort(yop.begin(), yop.end());
int ans = y... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
vector<int> yop, yoc;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
yop.push_back(x);
}
sort(yop.begin(), yop.end());
int ans = y... | replace | 20 | 21 | 20 | 21 | 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++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> X... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define agewari(a, b) ((ll)a + ((ll)b - 1)) / b
const int MOD = 1000000007;
const long long INF = 1LL << 60;
using Graph = vector<vector<ll>>;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> X... | insert | 15 | 15 | 15 | 20 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int uint... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int uint... | replace | 44 | 45 | 44 | 45 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m, x[N], ans;
priority_queue<int> q;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; ++i)
scanf("%d", &x[i]);
sort(x + 1, x + m + 1);
ans = x[m] - x[1];
for (int i = 1; i < m; ++i)
q.push(x[i + 1] - x[i]);
for ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m, x[N], ans;
priority_queue<int> q;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; ++i)
scanf("%d", &x[i]);
sort(x + 1, x + m + 1);
ans = x[m] - x[1];
for (int i = 1; i < m; ++i)
q.push(x[i + 1] - x[i]);
for ... | insert | 15 | 15 | 15 | 17 | 0 | |
p03137 | C++ | Runtime Error | /*......................*/
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <functional>
// using namespa... | /*......................*/
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <functional>
// using namespa... | insert | 49 | 49 | 49 | 53 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> v(m);
for (long long i = 0; i < m; i++) {
cin >> v[i];
}
if (m == 1) {
printf("0\n");
return 0;
}
sort(v.begin(), v.end());
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> v(m);
for (long long i = 0; i < m; i++) {
cin >> v[i];
}
if (m == 1) {
printf("0\n");
return 0;
}
sort(v.begin(), v.end());
... | replace | 30 | 32 | 30 | 32 | 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> x(m), len(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());
fo... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m), len(m - 1);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
if (m == 1) {
cout << "0" << endl;
return 0;
}
if (n > m) {
n = m;
}
... | insert | 19 | 19 | 19 | 23 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
int main(int argc, char const *argv[]) {
int N, M, len = 0;
scanf("%d %d", &N, &M);
int dest[M], space[M - 1];
for (int i = 0; i < M; ++i)
scanf("%d", &(dest[i]));
std::sort(dest, dest + M);
for (int i = 0; i < M - 1; ++i)
space[i] = dest[i + 1] - dest[i];
... | #include <algorithm>
#include <cstdio>
int main(int argc, char const *argv[]) {
int N, M, len = 0;
scanf("%d %d", &N, &M);
if (N > M) {
printf("0\n");
exit(0);
}
int dest[M], space[M - 1];
for (int i = 0; i < M; ++i)
scanf("%d", &(dest[i]));
std::sort(dest, dest + M);
for (int i = 0; i < ... | insert | 6 | 6 | 6 | 10 | 0 | |
p03137 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
// n個のコマの担当範囲をどう区切るかの問題に帰着できる
// 範囲を決めることは、その右端から次の担当コマまでの区間をカウントしなくてよくすることと同義
int main() {
int n, m;
cin >> n >> m;
vector<int... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const ll INF = 1LL << 60;
// n個のコマの担当範囲をどう区切るかの問題に帰着できる
// 範囲を決めることは、その右端から次の担当コマまでの区間をカウントしなくてよくすることと同義
int main() {
int n, m;
cin >> n >> m;
vector<int... | replace | 13 | 14 | 13 | 14 | 0 | |
p03137 | C++ | Runtime Error |
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <numeric>
#include <type_traits>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i];
}
sort(x.begin(... |
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <numeric>
#include <type_traits>
#include <vector>
using namespace std;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> x(m);
if (n >= m) {
cout << 0 << endl;
return 0;
}
for (int ... | insert | 16 | 16 | 16 | 20 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); ... | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); ... | replace | 44 | 47 | 44 | 45 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define LARGE 1000000000
#define MOD 100000
int N, M, sum;
int ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define LARGE 1000000000
#define MOD 100000
int N, M, sum;
int ... | replace | 23 | 24 | 23 | 24 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m), d(m);
for (int i = 0; i < m; i++)
cin >> x[i];
sort(x.begin(), x.end());
int ans = 0;
for (int i = 0; i < m - 1; i++) {
d[i] = x[i + 1] - x[i];
ans += d[i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m), d(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 ans = 0;
for (int i = 0; i <... | insert | 13 | 13 | 13 | 17 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
int main() {
int n, m;
cin >> n >> m;
long long x[100000];
vector<long> d(m - 1);
for (int i = 0; i < m; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
int main() {
int n, m;
cin >> n >> m;
long long x[100000];
vector<long> d(m - 1);
for (int i = 0; i < m; ++i) {
... | replace | 19 | 20 | 19 | 20 | 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;
}
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++)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0;
return 0;
}
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... | insert | 11 | 11 | 11 | 12 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> x(M);
for (auto i = x.begin(); i != x.end(); i++) {
std::cin >> *i;
}
if (N >= M) {
std::cout << 0 << std::endl;
} else {
std::sort(x.begin(), x.end());
int sum = *(x.... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> x(M);
for (auto i = x.begin(); i != x.end(); i++) {
std::cin >> *i;
}
if (N >= M) {
std::cout << 0 << std::endl;
} else {
std::sort(x.begin(), x.end());
int sum = *(x.... | replace | 28 | 29 | 28 | 29 | -11 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = INT32_MAX;
const long long int Mod = 1000000007;
const long long int mod = 100000; // 10^5
using ll = long long int; // long long int は64bit
using ci = const int;
using vi = vector<int>;
using Vi ... | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = INT32_MAX;
const long long int Mod = 1000000007;
const long long int mod = 100000; // 10^5
using ll = long long int; // long long int は64bit
using ci = const int;
using vi = vector<int>;
using Vi ... | replace | 63 | 64 | 63 | 69 | 0 | |
p03137 | C++ | Runtime Error |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define INF 2147... | replace | 52 | 53 | 52 | 53 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vi a(m);
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vi a(m);
for (int i = 0; i <... | replace | 31 | 32 | 31 | 32 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[123456], b[123456];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a, a + m);
for (int i = 1; i < m; i++) {
b[i - 1] = a[i] - a[i - 1];
}
sort(b, b + m - 1);
cout << accumulate(b, b + m - n, 0LL) << e... | #include <bits/stdc++.h>
using namespace std;
int a[123456], b[123456];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a, a + m);
for (int i = 1; i < m; i++) {
b[i - 1] = a[i] - a[i - 1];
}
sort(b, b + m - 1);
cout << accumulate(b, max(b + m - n, b + 0... | replace | 15 | 16 | 15 | 16 | 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;
X.resize(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N >= M) {
cout << 0 << endl;
return 0;
}
sor... | #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;
X.resize(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
if (N >= M) {
cout << 0 << endl;
return 0;
}
sor... | replace | 25 | 26 | 25 | 26 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#define MAX 10001
using namespace std;
int main() {
int n;
int m;
int zahyo[MAX];
long long int ans = 0;
bool ff = true;
cin >> n >> m;
if (n > m) {
ff = false;
}
for (int i = 0; i < m; ++i) {
cin >> zahyo[i];
}
sort(zahyo, zahyo + m);
int di... | #include <algorithm>
#include <iostream>
#define MAX 100001
using namespace std;
int main() {
int n;
int m;
int zahyo[MAX];
long long int ans = 0;
bool ff = true;
cin >> n >> m;
if (n > m) {
ff = false;
}
for (int i = 0; i < m; ++i) {
cin >> zahyo[i];
}
sort(zahyo, zahyo + m);
int d... | replace | 2 | 3 | 2 | 3 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
vector<int> diff(m - 1);
rep(i, m) { cin >> x[i]; }
if (m == 1) {
puts("0");
return 0;
}
sort(x.begin(), x.end());
ll an... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
vector<int> diff(m - 1);
rep(i, m) { cin >> x[i]; }
if (m <= n) {
puts("0");
return 0;
}
sort(x.begin(), x.end());
ll an... | replace | 12 | 13 | 12 | 13 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vect... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vect... | replace | 49 | 51 | 49 | 51 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | replace | 29 | 30 | 29 | 30 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = 1145141919, MOD = 1e9 + 7;
const long long LINF = 8931145141919364364, LMOD = 998244353;
inline long long mod(long long n, long long m) { return (n % m + m) % m; }
// const i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
const int INF = 1145141919, MOD = 1e9 + 7;
const long long LINF = 8931145141919364364, LMOD = 998244353;
inline long long mod(long long n, long long m) { return (n % m + m) % m; }
// const i... | insert | 16 | 16 | 16 | 17 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (long long i = a; i < b; i += 1)
#define repr(i, a, b) for (long long i = a; i <= b; i += 1)
#define vec vector<ll>
#define map map<string, int>
#define repa(p, A) for (auto p : A)
#define pb push_back
#define sort(a) sort(a.begin(), a.end())
#defin... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, a, b) for (long long i = a; i < b; i += 1)
#define repr(i, a, b) for (long long i = a; i <= b; i += 1)
#define vec vector<ll>
#define map map<string, int>
#define repa(p, A) for (auto p : A)
#define pb push_back
#define sort(a) sort(a.begin(), a.end())
#defin... | replace | 23 | 24 | 23 | 25 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.