problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03208 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 999,809 | 999,810 | u879674287 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)... | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 999,811 | 999,810 | u879674287 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)... | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.value.change"
] | 999,812 | 999,810 | u879674287 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
ll h[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
ll mini = 1e9;
sort(h, h + n);
for (ll i = 0; i < n - k; i++) {
mini = min(mini, h[i + k] - h[i]);
... | #include <bits/stdc++.h>
using namespace std;
constexpr long long MOD = 1000000007;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
ll h[n];
for (ll i = 0; i < n; i++) {
cin >> h[i];
}
ll mini = 1e9;
sort(h, h + n);
for (ll i = 0; i < n - k + 1; i++) {
mini = min(mini, h[i + k - 1] - ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 999,830 | 999,831 | u371051907 | cpp |
p03208 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
long long MIN(long long a, long long b) {
if (a < b)
return a;
return b;
}
int main() {
long long n, k;
cin >> n >> k;
long long h[n];
for (int i = 0; i < n; i++)
cin >> h[i... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
long long MIN(long long a, long long b) {
if (a < b)
return a;
return b;
}
int main() {
long long n, k;
cin >> n >> k;
long long h[n];
for (int i = 0; i < n; i++)
cin >> h[i... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change"
] | 999,834 | 999,833 | u904995051 | cpp |
p03208 | #include <bits/stdc++.h>
#include <cmath>
#define N 100005
#define A 1000005
#define MOD 998244353 // 1000000007 // //100000000
#define inf 1000000000000000000
#define ll long long
//#define M_PI 3.141592653589793238463
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define ... | #include <bits/stdc++.h>
#include <cmath>
#define N 100005
#define A 1000005
#define MOD 998244353 // 1000000007 // //100000000
#define inf 1000000000000000000
#define ll long long
//#define M_PI 3.141592653589793238463
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define ... | [
"expression.operation.binary.add"
] | 999,842 | 999,843 | u448570453 | cpp |
p03208 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | [
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 999,844 | 999,845 | u341447450 | cpp |
p03208 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define all(a) a.begin(), a.end()
#de... | [
"expression.operation.binary.remove",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 999,846 | 999,845 | u341447450 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 999,865 | 999,866 | u297738015 | cpp |
p03208 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... | [
"expression.operation.binary.add"
] | 999,869 | 999,870 | u983547593 | cpp |
p03208 |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... |
#define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define ... | [
"expression.operation.binary.add"
] | 999,869 | 999,871 | u983547593 | cpp |
p03208 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mi... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
/*struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) :x((x% mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mi... | [
"control_flow.loop.for.initializer.change"
] | 999,872 | 999,873 | u616794313 | cpp |
p03208 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"assignment.change"
] | 999,877 | 999,878 | u110044127 | cpp |
p03208 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"assignment.change"
] | 999,879 | 999,878 | u110044127 | cpp |
p03208 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"assignment.change"
] | 999,880 | 999,878 | u110044127 | cpp |
p03208 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | [
"variable_declaration.value.change",
"identifier.change",
"assignment.change"
] | 999,881 | 999,878 | u110044127 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int ans = INT_MAX;
for (int i = 0; i < n - k + 1; i++)
ans = min(ans, a[i + k] - a[i]);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int ans = INT_MAX;
for (int i = 0; i < n - k + 1; i++)
ans = min(ans, a[i + k - 1] - a[i]);
cout << ans << endl;
} | [
"assignment.change"
] | 999,882 | 999,883 | u198693633 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0, M = 0, ans1 = 0, ans2 = 0;
cin >> N >> M;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
sort(A.begin(), A.end()); //小さい順
vector<ll> s(N);
rep(i, N - 1) { s[i] = A[i + ... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0, M = 0, ans1 = 0, ans2 = 0;
cin >> N >> M;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
sort(A.begin(), A.end()); //小さい順
vector<ll> s(N);
rep(i, N - 1) { s[i] = A[i + ... | [
"expression.operation.binary.add"
] | 999,886 | 999,887 | u213375012 | cpp |
p03208 | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll>... | const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll>... | [
"control_flow.loop.for.initializer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 999,890 | 999,891 | u798339690 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<long long int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
long long int ans = 100000000;
rep(i, n - k) {
long long int now ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<long long int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
long long int ans = 1000000000;
rep(i, n - k + 1) {
long long int... | [
"literal.number.change",
"variable_declaration.value.change"
] | 999,896 | 999,895 | u436660228 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main() {
int N, K, tmp, ans = mod;
cin >> N >> K;
vector<int> list(N);
for (int i = 0; i < N; i++)
cin >> list[i];
sort(list.begin(), list.end());
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int64_t mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main() {
int N, K, tmp, ans = mod;
cin >> N >> K;
vector<int> list(N);
for (int i = 0; i < N; i++)
cin >> list[i];
sort(list.begin(), list.end());
for (int i ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 999,898 | 999,899 | u058742919 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
int mindiff = 0;
int d;
cin >> N >> K;
vector<int> h(N);
vector<int> diff(N - 1);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
for (int i = 1; i < N; i++) {
diff[i - 1] = h[i] - h[i - 1];
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
int mindiff = 0;
int d;
cin >> N >> K;
vector<int> h(N);
vector<int> diff(N - 1);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
for (int i = 1; i < N; i++) {
diff[i - 1] = h[i] - h[i - 1];
... | [
"assignment.add"
] | 999,908 | 999,909 | u346040900 | cpp |
p03208 | // C - Christmas Eve
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *... | // C - Christmas Eve
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 999,912 | 999,913 | u363892646 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"assignment.change"
] | 999,914 | 999,915 | u748757847 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int p[n];
for (int i = 0; i < n; i++)
cin >> p[i];
sort(p, p + n);
int ans = 1e9;
for (int i = 0; i < n - k; i++) {
ans = min(ans, p[i + k] - p[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int p[n];
for (int i = 0; i < n; i++)
cin >> p[i];
sort(p, p + n);
int ans = 1e9;
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, p[i + k - 1] - p[i]);
}
cout << ans << endl;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 999,924 | 999,925 | u983681697 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<int> h(N);
for (int i = 0; i < N; i++) {
std::cin >> h.at(i);
}
std::sort(h.begin(), h.end());
int min = 1000000000;
for (int i = 0; i < N + K - 1; i++) {
int temp = h.at(i + K - 1)... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<int> h(N);
for (int i = 0; i < N; i++) {
std::cin >> h.at(i);
}
std::sort(h.begin(), h.end());
int min = 1000000000;
for (int i = 0; i < N - K + 1; i++) {
int temp = h.at(i + K - 1)... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 999,935 | 999,936 | u327750344 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<int> h(N);
for (int i = 0; i < N; i++) {
std::cin >> h.at(i);
}
std::sort(h.begin(), h.end());
int min = 1000000000;
for (int i = 0; i < N - 2; i++) {
int temp = h.at(i + K - 1) - h... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<int> h(N);
for (int i = 0; i < N; i++) {
std::cin >> h.at(i);
}
std::sort(h.begin(), h.end());
int min = 1000000000;
for (int i = 0; i < N - K + 1; i++) {
int temp = h.at(i + K - 1)... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one"
] | 999,937 | 999,936 | u327750344 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
int main() {
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H.at(i);
}
sort(H.begin(), H.end());
long long ans = INF;
for (long long i = 0; i < N - K; i++) {
ans = min(ans, H.a... | #include <bits/stdc++.h>
using namespace std;
#define INF 10000000000
int main() {
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H.at(i);
}
sort(H.begin(), H.end());
long long ans = INF;
for (long long i = 0; i <= N - K; i++) {
ans = min(ans, H... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 999,944 | 999,945 | u251242696 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define INF 10000000
int main() {
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H.at(i);
}
sort(H.begin(), H.end());
long long ans = INF;
for (long long i = 0; i < N - K; i++) {
ans = min(ans, H.at(... | #include <bits/stdc++.h>
using namespace std;
#define INF 10000000000
int main() {
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H.at(i);
}
sort(H.begin(), H.end());
long long ans = INF;
for (long long i = 0; i <= N - K; i++) {
ans = min(ans, H... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 999,947 | 999,945 | u251242696 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
int m = 2000000000;
for (int i = 0; i < n - k + 1; i++) {
if (m > abs(h[i] - h[i + k - 1]))
m = h[i] - h[i + k - 1];
}
cout << m;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
int m = 2000000000;
for (int i = 0; i < n - k + 1; i++) {
if (m > abs(h[i] - h[i + k - 1]))
m = abs(h[i] - h[i + k - 1]);
}
cout << m;
}
| [
"call.add",
"call.arguments.change"
] | 999,948 | 999,949 | u222643545 | cpp |
p03208 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 999,958 | 999,959 | u314543767 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n, k;
cin >> n >> k;
vec h(n);
for (ll i = 0; i < n; i++)
cin >> h[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n, k;
cin >> n >> k;
vec h(n);
for (ll i = 0; i < n; i++)
cin >> h[i];
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 999,960 | 999,961 | u718758485 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define VI vector<int>
#define MOD 1000000007
using ll = long long int;
using P = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 999,962 | 999,963 | u868089307 | cpp |
p03208 | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define Yes(hoge) cout << ((hoge) ? "Yes" : "No") << endl;
#define YES(hoge) cout << ((hoge) ? "YES" :... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 999,964 | 999,965 | u905715926 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
... | [
"expression.operation.binary.add"
] | 999,968 | 999,969 | u501163846 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(ALL(h));
int ans = IN... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(ALL(h));
int ans = IN... | [
"assignment.change"
] | 999,992 | 999,993 | u184929210 | cpp |
p03208 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#i... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#i... | [] | 999,998 | 999,999 | u114137758 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
in... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,000,004 | 1,000,005 | u167206842 | cpp |
p03208 | #define MOD_TYPE 2
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using multiInt = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/
/*
#pragma GCC target("avx2")... | #define MOD_TYPE 2
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using multiInt = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/
/*
#pragma GCC target("avx2")... | [
"call.arguments.change"
] | 1,000,011 | 1,000,012 | u878615689 | cpp |
p03208 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,000,026 | 1,000,027 | u814715203 | cpp |
p03208 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 1,000,028 | 1,000,027 | u814715203 | cpp |
p03208 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.break.remove",
"control_flow.continue.add"
] | 1,000,029 | 1,000,027 | u814715203 | cpp |
p03208 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = 9... | [
"call.add"
] | 1,000,034 | 1,000,035 | u096616343 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> trees(n);
for (int i = 0; i < n; i++) {
cin >> trees[i];
}
ll ans = 1145141919810364;
sort(trees.begin(), trees.end());
for (int i = 0; i < n - k; i++) {
ans = min(trees[i + k - 1]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> trees(n);
for (int i = 0; i < n; i++) {
cin >> trees[i];
}
ll ans = 1145141919810364;
sort(trees.begin(), trees.end());
for (int i = 0; i <= n - k; i++) {
ans = min(trees[i + k - 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,036 | 1,000,037 | u962609087 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
using ll = long long;
using vl = vector<ll>;
using vvl ... | [
"expression.operation.binary.add"
] | 1,000,038 | 1,000,039 | u936602931 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long x, long y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
long long lcm(long x, long y) { return x * y / gcd(x, y); }
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
int N, K, h[100010] = ... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long x, long y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
long long lcm(long x, long y) { return x * y / gcd(x, y); }
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
int N, K, h[100010] = ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,043 | 1,000,044 | u097396733 | cpp |
p03208 | //----------------------------------------------------------------------
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vecto... | //----------------------------------------------------------------------
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vecto... | [
"expression.operation.binary.remove"
] | 1,000,052 | 1,000,053 | u539826121 | cpp |
p03208 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T..... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T..... | [
"expression.operation.binary.add"
] | 1,000,082 | 1,000,083 | u089177147 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h.at(i);
sort(h.begin(), h.end());
int ans = 0;
for (int i = 0; i <= N - K; i++) {
int dh = h.at(N - K + i) - h.at(i);
if (i == 0)
ans = dh;
else... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++)
cin >> h.at(i);
sort(h.begin(), h.end());
int ans = 0;
for (int i = 0; i <= N - K; i++) {
int dh = h.at(K - 1 + i) - h.at(i);
if (i == 0)
ans = dh;
else... | [
"expression.operation.binary.remove"
] | 1,000,088 | 1,000,089 | u987575170 | cpp |
p03208 | #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... | #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... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"literal.number.change"
] | 1,000,093 | 1,000,094 | u120143737 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define ll long long
#define ii pair<string, int> ii;
string IntToStr(int tmp) {
ostringstream out;
out << tmp;
return out.str();
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> v;
while (n... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define ll long long
#define ii pair<string, int> ii;
string IntToStr(int tmp) {
ostringstream out;
out << tmp;
return out.str();
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> v;
while (n... | [
"control_flow.loop.for.condition.change"
] | 1,000,095 | 1,000,096 | u431107078 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define ll long long
#define ii pair<string, int> ii;
string IntToStr(int tmp) {
ostringstream out;
out << tmp;
return out.str();
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> v;
while (n... | #include <bits/stdc++.h>
using namespace std;
#define lp(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define ll long long
#define ii pair<string, int> ii;
string IntToStr(int tmp) {
ostringstream out;
out << tmp;
return out.str();
}
int main() {
int n, k;
cin >> n >> k;
vector<ll> v;
while (n... | [
"control_flow.loop.for.condition.change"
] | 1,000,097 | 1,000,096 | u431107078 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
int hd =... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(all(h));
int hd =... | [
"expression.operation.binary.add"
] | 1,000,098 | 1,000,099 | u443971699 | cpp |
p03208 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
sort(h.begin(), h.end());
k--;
int mn = 1e9;
for (int i = 0; i < n - (k - 1); ++i) {
mn = min(mn, h[i + (k - 1)] - h[i]);
}
cout << mn << endl;
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
sort(h.begin(), h.end());
int mn = 1e9;
for (int i = 0; i < n - (k - 1); ++i) {
mn = min(mn, h[i + (k - 1)] - h[i]);
}
cout << mn << endl;
return... | [
"expression.unary.arithmetic.remove"
] | 1,000,100 | 1,000,101 | u242580186 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
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();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | #include <bits/stdc++.h>
using namespace std;
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();
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
ty... | [
"expression.operation.binary.add"
] | 1,000,112 | 1,000,113 | u934272719 | cpp |
p03208 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; ++i)
cin >> h[i];
sort(h.begin(), h.end());
int min_diff = h[N - 1] - h[0]... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
// void C_115()
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; ++i)
cin >> h[i];
sort(h.begin(), h.end());
int min_diff =... | [
"control_flow.loop.for.condition.change"
] | 1,000,118 | 1,000,119 | u323542775 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
int main() {
int n, k;
cin >> n >> k;
vl h(n);
rep(i, n) cin >> h[i];
sort(all(h));
se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
int main() {
int n, k;
cin >> n >> k;
vl h(n);
rep(i, n) cin >> h[i];
sort(all(h));
se... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,000,122 | 1,000,123 | u556120601 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
int main() {
int n, k;
cin >> n >> k;
vl h(n);
rep(i, n) cin >> h[i];
sort(all(h));
se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
int main() {
int n, k;
cin >> n >> k;
vl h(n);
rep(i, n) cin >> h[i];
sort(all(h));
se... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 1,000,124 | 1,000,123 | u556120601 | cpp |
p03208 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k, mi = 1000000000;
cin >> n >> k;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v.at(i);
sort(v.begin(), v.end(), greater<ll>());
for (ll i = 0; i < n - 2; i++) {
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k, mi = 1000000000;
cin >> n >> k;
vector<ll> v(n);
for (ll i = 0; i < n; i++)
cin >> v.at(i);
sort(v.begin(), v.end(), greater<ll>());
for (ll i = 0; i < n - k + 1; i++) ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one",
"assignment.value.change",
"call.arguments.change",
"assignment.change"
] | 1,000,137 | 1,000,138 | u573909039 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
ll intpow(int n, int m) {
if (m == 0)
return 1;
return n * intpow(n, m - 1);
}
ll gcd(ll n, ll m) {
n = ma... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;
ll intpow(int n, int m) {
if (m == 0)
return 1;
return n * intpow(n, m - 1);
}
ll gcd(ll n, ll m) {
n = ma... | [
"expression.operation.binary.add"
] | 1,000,139 | 1,000,140 | u151994289 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001], ans = -99999, sum;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
for (int i = 1; i <= n - k + 1; i++) {
sum = a[i + k - 1] - a[i];
ans = max(sum, ans);
}
cout << ans << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
int n, k, a[100001], ans = 1e9, sum;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
for (int i = 1; i <= n - k + 1; i++) {
sum = a[i + k - 1] - a[i];
ans = min(sum, ans);
}
cout << ans << endl;
return ... | [
"literal.number.change",
"variable_declaration.value.change",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,000,141 | 1,000,142 | u247366051 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define REP(i, j, n) for (int i = j; i < (n); i++)
#define RREP(i, n, j) for (int i = n; j <= i; i--)
#define print(out) cout << out << "\n";
#define all(vec) vec.begin(), vec.end()
#define mod 1000000007
const int INF = 1e9;
ty... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lb;
#define REP(i, j, n) for (int i = j; i < (n); i++)
#define RREP(i, n, j) for (int i = n; j <= i; i--)
#define print(out) cout << out << "\n";
#define all(vec) vec.begin(), vec.end()
#define mod 1000000007
const int INF = 1e9;
ty... | [
"expression.operation.binary.add"
] | 1,000,143 | 1,000,144 | u526459074 | cpp |
p03208 | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#include <cmath>
#include <cstdio>
#include <deque>
#include <map>
#include <set>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using ll = long long;
using Graph = vector<vector<int>>;
#include <queue>
#include <... | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#include <cmath>
#include <cstdio>
#include <deque>
#include <map>
#include <set>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
using ll = long long;
using Graph = vector<vector<int>>;
#include <queue>
#include <... | [
"control_flow.loop.for.condition.change"
] | 1,000,147 | 1,000,148 | u238197271 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[100000];
rep(i, n) { cin >> h[i]; }
sort(h, h + n);
return 0;
int ans = 100000;
for (int i = 0; i < n - k + 1... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[100000];
rep(i, n) { cin >> h[i]; }
sort(h, h + n);
int ans = 1000000000;
for (int i = 0; i < n - k + 1; i++) {... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,000,151 | 1,000,150 | u745267317 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end(), greater<long long>());
long long ans = 1000000000;
for (int i = 0; i <= n - k; i++) {
long long res = h[i] - h[k - 1];
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end(), greater<long long>());
long long ans = 1000000000;
for (int i = 0; i <= n - k; i++) {
long long res = h[i] - h[i + k - 1... | [
"assignment.change"
] | 1,000,160 | 1,000,161 | u934529721 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end(), greater<long long>());
long long ans = 1000000000;
for (int i = 0; i < n - k; i++) {
long long res = h[i] - h[k - 1];
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end(), greater<long long>());
long long ans = 1000000000;
for (int i = 0; i <= n - k; i++) {
long long res = h[i] - h[i + k - 1... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,162 | 1,000,161 | u934529721 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
#define vecout(v) \
for (int i = 0; i < v.size(); i++) { \
cout << v[i] << endl; ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
#define vecout(v) \
for (int i = 0; i < v.size(); i++) { \
cout << v[i] << endl; ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,000,163 | 1,000,164 | u247576416 | cpp |
p03208 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pai... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define lper(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define mp make_pai... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"assignment.change"
] | 1,000,179 | 1,000,180 | u978260507 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> T(N);
for (int i = 0; i < N; i++) {
cin >> T[i];
}
sort(T.begin(), T.end());
int minmax = 1000000001;
for (int i = 0; i < N - K; i++) {
minmax = min(minmax, T.at(i + K - 1) - T.at(i));
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> T(N);
for (int i = 0; i < N; i++) {
cin >> T[i];
}
sort(T.begin(), T.end());
int minmax = 1000000001;
for (int i = 0; i < N - K + 1; i++) {
minmax = min(minmax, T.at(i + K - 1) - T.at(i));
}
cout... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,191 | 1,000,192 | u469315559 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
int ans = 1e9;
for (int i = 0; i < n - k - 1; i++) {
ans = min(ans, h[i + k - 1] - h[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
int ans = 1e9;
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, h[i + k - 1] - h[i]);
}
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,000,195 | 1,000,196 | u057810841 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
int ans = 1e9;
for (int i = 0; i < n - k - 1; i++) {
ans = min(ans, h[i + k - 1] - h[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
int ans = 1e9;
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, h[i + k - 1] - h[i]);
}
cout << ans << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,000,195 | 1,000,197 | u057810841 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (... | [
"expression.operation.binary.add"
] | 1,000,200 | 1,000,201 | u330661451 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
int ans = 2000000000;
for (int i = 0; i < N - K; i++) {
ans = min(ans, h.at(K + i - 1) - h.at(i));
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
int ans = 2000000000;
for (int i = 0; i <= N - K; i++) {
ans = min(ans, h.at(K + i - 1) - h.at(i));
}
cout << ans <... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,207 | 1,000,208 | u817769480 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
int ans = 1500000000;
for (int i = 0; i < N - K; i++) {
ans = min(ans, h.at(K + i - 1) - h.at(i));
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
int ans = 2000000000;
for (int i = 0; i <= N - K; i++) {
ans = min(ans, h.at(K + i - 1) - h.at(i));
}
cout << ans <... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,209 | 1,000,208 | u817769480 | cpp |
p03208 | // [[ABC134C] Exception Handling] https://www.luogu.com.cn/problem/AT4843
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N + 3];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
sort(h + 1, h + 1 + N);
int minn = 1e9;
for (int... | // [[ABC134C] Exception Handling] https://www.luogu.com.cn/problem/AT4843
#include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int h[N + 3];
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
sort(h + 1, h + 1 + N);
int minn = 1e9;
for (int... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,217 | 1,000,218 | u440588451 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define floop(i, N) for (ll i = 0; i < N; i++)
#define floop1(i, N) for (ll i = 1; i <= N; i++)
#define out(ans) cout << ans << endl
#define in(n) cin >> n
constexpr ll inf = 1e18;
void solve();
int main() { solve(); }
void solve() {
ll n, k;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define floop(i, N) for (ll i = 0; i < N; i++)
#define floop1(i, N) for (ll i = 1; i <= N; i++)
#define out(ans) cout << ans << endl
#define in(n) cin >> n
constexpr ll inf = 1e18;
void solve();
int main() { solve(); }
void solve() {
ll n, k;
... | [
"assignment.change"
] | 1,000,221 | 1,000,222 | u789673251 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
int m = abs(vec[k - 1] - vec[0]);
for (int i = 1; i <= n - k + 1; i++) {
m = min(m, abs... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
int m = abs(vec[k - 1] - vec[0]);
for (int i = 1; i <= n - k; i++) {
m = min(m, abs(vec... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,000,227 | 1,000,228 | u302818391 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h;
for ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define big ((ll)(1e9) + 7)
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h;
for ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 1,000,231 | 1,000,232 | u115819033 | cpp |
p03208 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
#define int long long int
int n, k;
cin >> n;
cin >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
int result = h[k - 1] - h[0];
for (int i = 1; i < n - k - 1; i++) {
if (h[i + k - 1] - h[i]... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
#define int long long int
int n, k;
cin >> n;
cin >> k;
int h[n];
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
int result = h[k - 1] - h[0];
for (int i = 1; i < n - k + 1; i++) {
if (h[i + k - 1] - h[i]... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,000,239 | 1,000,240 | u101181042 | cpp |
p03208 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define INF LLONG_MAX
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int m... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define INF LLONG_MAX
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int m... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,000,245 | 1,000,246 | u552122040 | cpp |
p03208 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,259 | 1,000,260 | u143100985 | cpp |
p03208 | #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, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h.at(i);
sort(h.begin(), h.end());
int ans = h.at(k - 1) - h.at(0);
rep(i, n - k) { ans = min(ans, h.at(i + k... | #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, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h.at(i);
sort(h.begin(), h.end());
int ans = h.at(k - 1) - h.at(0);
rep(i, n - k + 1) { ans = min(ans, h.at(i... | [
"expression.operation.binary.add"
] | 1,000,278 | 1,000,279 | u440632112 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
sort(all(h));
ll ans = 1000000000;
for (int i = 0; i + K < N; i++... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
vector<ll> h(N);
for (int i = 0; i < N; i++)
cin >> h[i];
sort(all(h));
ll ans = 1000000000;
for (int i = 0; i + K - 1 < N... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 1,000,280 | 1,000,281 | u329706129 | cpp |
p03208 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int i = (m); (i) < (n); (i)++)
typedef long long ll;
int mai... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int i = (m); (i) < (n); (i)++)
typedef long long ll;
int mai... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,284 | 1,000,285 | u917282863 | cpp |
p03208 | /*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include... | /*
Templatka c++ Kacper Fis
//
*/
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 1,000,286 | 1,000,287 | u506295831 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
int a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
int a... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,000,296 | 1,000,297 | u561143568 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
int a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
typedef long long ll;
const int mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
int a... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change"
] | 1,000,298 | 1,000,297 | u561143568 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int count = 0;
int N, K, a = 1000000009;
cin >> N >> K;
vector<int> H(N);
rep(i, N) { cin >> H[i]; }
sort(H.begin(), H.end());
rep(i, N - K) {
if (H[i + K - 1] - H[i] < a) {
a = H[i +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int count = 0;
int N, K, a = 1000000009;
cin >> N >> K;
vector<int> H(N);
rep(i, N) { cin >> H[i]; }
sort(H.begin(), H.end());
rep(i, N - K + 1) {
if (H[i + K - 1] - H[i] < a) {
a = H... | [
"expression.operation.binary.add"
] | 1,000,322 | 1,000,323 | u573537453 | cpp |
p03208 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tupl... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 1,000,325 | 1,000,326 | u574045761 | cpp |
p03208 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
// logic
sort(h, h + n);
long int ans = h[k - 1] - h[0];
for (int i = 1; i < n - k; i++) {
long int temp = h[i + k - 1] - h[i];
(temp < ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
// logic
sort(h, h + n);
long int ans = h[k - 1] - h[0];
for (int i = 1; i < n - k + 1; i++) {
long int temp = h[i + k - 1] - h[i];
(tem... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,327 | 1,000,328 | u551519692 | cpp |
p03208 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
// logic
sort(h, h + n);
long int ans = h[k - 1] - h[0];
for (int i = 1; i < n - k; i++) {
long int temp = h[i + k] - h[i];
(temp < ans)... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long int h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
// logic
sort(h, h + n);
long int ans = h[k - 1] - h[0];
for (int i = 1; i < n - k + 1; i++) {
long int temp = h[i + k - 1] - h[i];
(tem... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,329 | 1,000,328 | u551519692 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s, k;
cin >> a >> s;
vector<int> b(a);
for (int i = 0; i < a; i++) {
cin >> b.at(i);
}
sort(b.begin(), b.end());
k = b.at(s - 1) - b.at(0);
for (int i = 0; i < a - s; i++) {
if (k > (b.at(s + i - 1) - b.at(i))) {
k = b.at(s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, s, k;
cin >> a >> s;
vector<int> b(a);
for (int i = 0; i < a; i++) {
cin >> b.at(i);
}
sort(b.begin(), b.end());
k = b.at(s - 1) - b.at(0);
for (int i = 0; i < a - s + 1; i++) {
if (k > (b.at(s + i - 1) - b.at(i))) {
k = b.... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,332 | 1,000,333 | u438035643 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, k;
cin >> n >> k;
int h[100005];
rep(i, n) cin >> h[i];
sort(h, h + n);
int ans = 1e9;
for (int i = 0; i + k - 1 <= k - 1; i++) {
ans = min... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, k;
cin >> n >> k;
int h[100005];
rep(i, n) cin >> h[i];
sort(h, h + n);
int ans = 1e9;
for (int i = 0; i + k - 1 <= n - 1; i++) {
ans = min... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,000,334 | 1,000,335 | u620735210 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> v(n);
for (auto &x : v)
cin >> x;
sort(v.begin(), v.end());
long long ret = 1e9 + 7;
for (int i = 0; i < n - k; i++)
ret = min(ret, v[i + k] - v[i]);
cout << ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> v(n);
for (auto &x : v)
cin >> x;
sort(v.begin(), v.end());
long long ret = 1e9 + 7;
for (int i = 0; i <= n - k; i++)
ret = min(ret, v[i + k - 1] - v[i]);
cou... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 1,000,338 | 1,000,339 | u595893956 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int A = 0;
vector<int> K(N);
for (int i = 0; i < N; i++) {
cin >> K.at(i);
}
sort(K.begin(), K.end());
reverse(K.begin(), K.end());
A = K.at(0) - K.at(2);
for (int i = 1; i < N - (M - 1); i++) {
A = min(A,... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int A = 0;
vector<int> K(N);
for (int i = 0; i < N; i++) {
cin >> K.at(i);
}
sort(K.begin(), K.end());
reverse(K.begin(), K.end());
A = K.at(0) - K.at(M - 1);
for (int i = 1; i < N - (M - 1); i++) {
A = mi... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,000,344 | 1,000,345 | u697858600 | cpp |
p03208 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
int minv = INT_MAX;
sort(h.begin(), h.end());
for (int i = 0; i < n - k; ++i) {
minv = min(h[i + k - 1] - h[i], minv);
}
cout... | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n; ++i)
cin >> h[i];
int minv = INT_MAX;
sort(h.begin(), h.end());
for (int i = 0; i < n - (k - 1); ++i) {
minv = min(h[i + k - 1] - h[i], minv);
}... | [
"control_flow.loop.for.condition.change"
] | 1,000,346 | 1,000,347 | u616461826 | cpp |
p03208 |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <algorithm>
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#inclu... |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <algorithm>
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#inclu... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,000,364 | 1,000,365 | u838594733 | cpp |
p03208 |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <algorithm>
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#inclu... |
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <algorithm>
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <functional>
#inclu... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,000,366 | 1,000,365 | u838594733 | cpp |
p03208 | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) cin >> h[i];
sort(h.begin(), h.end());
int ans = 100000000... | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
int N, K;
cin >> N >> K;
vector<int> h(N);
rep(i, N) cin >> h[i];
sort(h.begin(), h.end());
int ans = 100000000... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 1,000,382 | 1,000,383 | u895536055 | cpp |
p03208 | #include "bits/stdc++.h"
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> VL;
typedef vector<int> VI; //... | #include "bits/stdc++.h"
using namespace std;
#define INF 1e9
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end() //昇順
#define RALL(x) (x).rbegin(), (x).rend() // 降順
const long long mod = 1e9 + 7;
typedef priority_queue<int> PQ;
typedef vector<long long> VL;
typedef vector<int> VI; //... | [
"expression.operation.binary.add"
] | 1,000,386 | 1,000,387 | u718774863 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.