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 <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, K;
cin >> N >> K;
int h[N];
rep(i, N) cin >> h[i];
sort(h, h + N);
int ans = 1e5;
rep(i, N - K) ans = min(ans, h[i + K] - h[i]);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N, K;
cin >> N >> K;
int h[N];
rep(i, N) cin >> h[i];
sort(h, h + N);
int ans = 1e9;
rep(i, N - K + 1) ans = min(ans, h[i + K - 1] - h[i]);
cout << ans << endl;
return ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.change"
] | 1,000,392 | 1,000,391 | u408372746 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repf(i, a, b) for (int i = (a); i < (b); i++)
#define repi(i, a, b) for (int i = (a); i <= (b); i++)
#define repr(i, a, b) for (int i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#def... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,000,416 | 1,000,414 | u850516963 | cpp |
p03208 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 1,000,419 | 1,000,420 | u654115433 | cpp |
p03208 | #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... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,000,423 | 1,000,424 | u637983859 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1e9;
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define reps(i, s, n) for (int i = (s); (i) < (n); ++(i))
#define maxi(v) distance(v.begin(), max_element(v.begin(), v.end()))
#define mini(v) di... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 1e9;
#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (int i = 0; (i) < (n); ++(i))
#define reps(i, s, n) for (int i = (s); (i) < (n); ++(i))
#define maxi(v) distance(v.begin(), max_element(v.begin(), v.end()))
#define mini(v) di... | [
"expression.operation.binary.add"
] | 1,000,429 | 1,000,430 | u639732129 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> num(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
}
int ans = 100000000;
sort(num.begin(), num.end());
for (int i = 0; i < n - k; i++) {
int x = num[i + k - 1] - num[i];
ans = min(ans, x);
}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> num(n);
for (int i = 0; i < n; i++) {
cin >> num[i];
}
int ans = 1000000003;
sort(num.begin(), num.end());
for (int i = 0; i <= n - k; i++) {
int x = num[i + k - 1] - num[i];
ans = min(ans, x);
... | [
"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,435 | 1,000,434 | u351265848 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
int top = 0;
int p;
for (int i = 0; i < N; i++) {
cin >> p;
if (p > top) {
top = p;
}
sum += p;
}
sum -= top;
cout << sum << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int sum = 0;
int top = 0;
int p;
for (int i = 0; i < N; i++) {
cin >> p;
if (p > top) {
top = p;
}
sum += p;
}
sum -= top / 2;
cout << sum << endl;
} | [
"assignment.change"
] | 1,000,436 | 1,000,437 | u949406263 | cpp |
p03207 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int a[12];
int main() {
int T;
int i = 0;
int sum = 0;
scanf("%d", &T);
for (int i = 1; i <= T; i++) {
scanf("%d ", &a[i]);
}
sort(a + 1, a + 1 + T);
sum = a[1] / 2;
for (int i = 2; i <= T; i++) {
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int a[12];
int main() {
int T;
int i = 0;
int sum = 0;
scanf("%d", &T);
for (int i = 1; i <= T; i++) {
scanf("%d ", &a[i]);
}
sort(a + 1, a + 1 + T);
sum = a[T] / 2;
for (int i = 1; i <= T - 1; i++) ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control... | 1,000,441 | 1,000,442 | u655249353 | cpp |
p03207 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[11], n, i = 0, s = 0;
cin >> n;
for (; i < n; i++)
cin >> a[i];
sort(a, a + n);
s = -a[i] / 2;
for (i = 0; i < n; i++)
s += a[i];
cout << s << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a[11], n, i = 0, s = 0;
cin >> n;
for (; i < n; i++)
cin >> a[i];
sort(a, a + n);
s = -a[i - 1] / 2;
for (i = 0; i < n; i++)
s += a[i];
cout << s << endl;
} | [
"assignment.change"
] | 1,000,443 | 1,000,444 | u601082779 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p[10], mx = 0, sm = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
mx = max(mx, p[i]);
sm += p[i];
}
cout << (sm - mx) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p[10], mx = 0, sm = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
mx = max(mx, p[i]);
sm += p[i];
}
cout << (sm - mx / 2) << endl;
}
| [
"expression.operation.binary.add"
] | 1,000,445 | 1,000,446 | u798086274 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n], sum = 0, max = -1;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (max < p[i]) {
sum += max;
max = p[i];
continue;
}
sum += p[i];
}
max /= 2;
printf("%d\n", max + sum);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n], sum = 0, max = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (max < p[i]) {
sum += max;
max = p[i];
continue;
}
sum += p[i];
}
max /= 2;
printf("%d\n", max + sum);
return 0;
} | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,000,449 | 1,000,450 | u214502450 | cpp |
p03207 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n], sum, max;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (max < p[i]) {
sum += max;
max = p[i];
continue;
}
sum += p[i];
}
max /= 2;
printf("%d\n", max + sum);
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n], sum = 0, max = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (max < p[i]) {
sum += max;
max = p[i];
continue;
}
sum += p[i];
}
max /= 2;
printf("%d\n", max + sum);
return 0;
} | [
"variable_declaration.value.change"
] | 1,000,451 | 1,000,450 | u214502450 | cpp |
p03207 | #include <float.h>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int nN = 0;
cin >> nN;
long lnPrice[10];
long lnMaxIdx = 0;
for (int i = 0; i < nN; i++) {
cin >> lnPrice[i];
if (i <= 1 && lnPrice[lnMaxIdx] < lnPrice[i])
... | #include <float.h>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int nN = 0;
cin >> nN;
long lnPrice[10];
long lnMaxIdx = 0;
for (int i = 0; i < nN; i++) {
cin >> lnPrice[i];
if (i >= 1 && lnPrice[lnMaxIdx] < lnPrice[i])
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,000,469 | 1,000,470 | u819215382 | cpp |
p03207 | #include <stdio.h>
void sort(int *v, int l) {
for (int i = 1; i < l; i++) {
for (int j = 0; j < i - 1; j++) {
if (v[j] < v[j + 1]) {
int tmp = v[j];
v[j] = v[j + 1];
v[j + 1] = tmp;
}
}
}
return;
}
int main() {
int input;
scanf("%d", &input);
int *value = new int[... | #include <stdio.h>
void sort(int *v, int l) {
for (int i = 1; i < l; i++) {
for (int j = 0; j < l - 1; j++) {
if (v[j] < v[j + 1]) {
int tmp = v[j];
v[j] = v[j + 1];
v[j + 1] = tmp;
}
}
}
return;
}
int main() {
int input;
scanf("%d", &input);
int *value = new int[... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,000,486 | 1,000,487 | u202260176 | cpp |
p03207 | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
// int Max_size = 10;
int main() {
static int n;
cin >> n;
int array[n];
int max_v;
int num = 0;
for (int i = 0; i < n; i++) {
cin >> array[i];
if (i != 0) {
if (array[i] > array[i - 1]) {
max_v = a... | #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;
// int Max_size = 10;
int main() {
static int n;
cin >> n;
int array[n];
int max_v;
int num = 0;
for (int i = 0; i < n; i++) {
cin >> array[i];
if (i != 0) {
if (array[i] > max_v) {
max_v = array[i]... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,000,495 | 1,000,496 | u465669072 | cpp |
p03207 | #include <bits/stdc++.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(n);
}
sort(vec.begin(), vec.end());
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum = sum + vec.at(i);
}
sum = ... | #include <bits/stdc++.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int sum = 0;
for (int i = 0; i < n - 1; i++) {
sum = sum + vec.at(i);
}
sum = ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,000,497 | 1,000,498 | u132284673 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a)
cin >> x;
sort(a.begin(), a.end());
cout << accumulate(a.begin(), a.end(), 0LL) - (a[2] / 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a)
cin >> x;
sort(a.begin(), a.end());
cout << accumulate(a.begin(), a.end(), 0LL) - (a.back() / 2) << endl;
}
| [
"call.arguments.change"
] | 1,000,503 | 1,000,504 | u705918648 | cpp |
p03207 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int s;
int max_price = 0;
for (int i = 0; i < n; i++) {
int p;
scanf("%d", &p);
if (p > max_price) {
max_price = p;
}
s += p;
}
s -= max_price / 2;
printf("%d\n", s);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int s = 0;
int max_price = 0;
for (int i = 0; i < n; i++) {
int p;
scanf("%d", &p);
if (p > max_price) {
max_price = p;
}
s += p;
}
s -= max_price / 2;
printf("%d\n", s);
return 0;
} | [
"variable_declaration.value.change"
] | 1,000,527 | 1,000,528 | u811561461 | cpp |
p03207 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp> namespace mp =
//boost::multiprecision; //mp::cpp_intで宣言
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9 + 7)
#define i_5 (ll)(1E9 + 5)
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
else
return c + i_7;
}
typedef... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp> namespace mp =
//boost::multiprecision; //mp::cpp_intで宣言
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9 + 7)
#define i_5 (ll)(1E9 + 5)
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
else
return c + i_7;
}
typedef... | [
"assignment.change"
] | 1,000,529 | 1,000,530 | u763881112 | cpp |
p03207 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int N;
int main() {
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p.at(i);
sort(p.begin(), p.end()... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int N;
int main() {
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++)
cin >> p.at(i);
sort(p.begin(), p.end()... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 1,000,533 | 1,000,534 | u012298376 | cpp |
p03208 | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
#define int lint
const int INF = 1e7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
#defin... | #include "bits/stdc++.h"
using namespace std;
const int MOD = 1e9 + 7;
typedef long long lint;
#define int lint
const int INF = 1e7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, k, n) for (int i = (k); i < (int)(n); ++i)
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
#defin... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,000,540 | 1,000,541 | u177382472 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 100000000
typedef long long int LL;
int main() {
int N, K;
cin >> N >> K;
vector<LL> h(N);
rep(i, N) { cin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1000000000
typedef long long int LL;
int main() {
int N, K;
cin >> N >> K;
vector<LL> h(N);
rep(i, N) { ci... | [
"preprocessor.define.value.change",
"literal.integer.change",
"assignment.change"
] | 1,000,553 | 1,000,552 | u587857074 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n;
vector<int> vals(n);
for (int &v : vals)
cin >> v;
sort(vals.begin(), vals.end());
int ans = 1 << 30;
for (int i = 0; i <= n - k; i++)
ans = min(ans, vals[i + k - 1] - vals[i]);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> vals(n);
for (int &v : vals)
cin >> v;
sort(vals.begin(), vals.end());
int ans = 1 << 30;
for (int i = 0; i <= n - k; i++)
ans = min(ans, vals[i + k - 1] - vals[i]);
cout << ans << endl;
return 0;
}... | [
"expression.operation.binary.add"
] | 1,000,559 | 1,000,560 | u251828455 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K;
cin >> N ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K;
cin >> N ... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,561 | 1,000,562 | u822169805 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K;
cin >> N ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K;
cin >> N ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,563 | 1,000,562 | u822169805 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define INFF 9223372036854775807
#define ll long long
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
template ... | #include <bits/stdc++.h>
using namespace std;
#define INF 2147483647
#define INFF 9223372036854775807
#define ll long long
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, m, n) for (int i = m; i < n; i++)
#define ALL(N) (N.begin(), N.end())
#define de cout << "debug" << endl;
template... | [
"preprocessor.define.value.change",
"literal.integer.change",
"expression.operation.binary.add",
"call.add",
"call.arguments.change"
] | 1,000,579 | 1,000,577 | u901397311 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int ans = 1 << 29;
int main() {
int n, k;
int h[100005];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (int i = 0; i < k; i++) {
if (ans > h[i + k - 1] - h[i]) {
ans = h[i + k - 1] - h[i];
}
}
cout <... | #include <bits/stdc++.h>
using namespace std;
int ans = 1 << 30;
int main() {
int n, k;
int h[100005];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (int i = 0; i < n - k + 1; i++) {
if (ans > h[i + k - 1] - h[i]) {
ans = h[i + k - 1] - h[i];
}
}
... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,585 | 1,000,584 | u691878051 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int ans = 1 << 29;
int main() {
int n, k;
int h[100005];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (int i = 0; i < n - 2; i++) {
if (ans > h[i + k - 1] - h[i]) {
ans = h[i + k - 1] - h[i];
}
}
co... | #include <bits/stdc++.h>
using namespace std;
int ans = 1 << 30;
int main() {
int n, k;
int h[100005];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
for (int i = 0; i < n - k + 1; i++) {
if (ans > h[i + k - 1] - h[i]) {
ans = h[i + k - 1] - h[i];
}
}
... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,586 | 1,000,584 | u691878051 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#include <stdlib.h>
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
#define MIN(a, b) ((a) < (b) ? (a) : (b))
int main(void) {
int N, K;
int ans = 1000000010;
int L[1000000];
cin >> N;
cin >> K;
for (int i = 0; i < N; i++) {
cin >> L[... | #include <bits/stdc++.h>
using namespace std;
#include <stdlib.h>
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
#define MIN(a, b) ((a) < (b) ? (a) : (b))
int main(void) {
int N, K;
int ans = 1000000010;
int L[1000000];
cin >> N;
cin >> K;
for (int i = 0; i < N; i++) {
cin >> L[... | [
"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,589 | 1,000,590 | u926181697 | cpp |
p03208 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int N, K;
int h[100005];
int IMF = 1000000000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
sort(h, h + N);
int ans = IMF;
for (int i = 0; i < N - K... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int N, K;
int h[100005];
int IMF = 1000000000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> h[i];
sort(h, h + N);
int ans = IMF;
for (int i = 0; i < N - K... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,593 | 1,000,594 | u525137785 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, K;
cin >> N >> K;
vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
sort(v.begin(), v.end());
int ans = 1000000000;
for (int i = 0; i < N - 2; i++) {
ans = min(ans, v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, K;
cin >> N >> K;
vector<int> v(N);
for (int i = 0; i < N; i++)
cin >> v[i];
sort(v.begin(), v.end());
int ans = 1000000000;
for (int i = 0; i < N - K + 1; i++) {
ans = min(an... | [
"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"
] | 1,000,595 | 1,000,596 | u874723578 | cpp |
p03208 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int i;
ll N, K;
ll mind, tmp;
cin >> N >> K;
vector<ll> h(N);
for (i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
mind = h[K - 1] - h[0];
tmp = mind;
for (i = K; i < N; i++) {
tmp = h[i] - h[... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int i;
ll N, K;
ll mind, tmp;
cin >> N >> K;
vector<ll> h(N);
for (i = 0; i < N; i++) {
cin >> h[i];
}
sort(h.begin(), h.end());
mind = h[K - 1] - h[0];
tmp = mind;
for (i = K; i < N; i++) {
tmp = h[i] - h[... | [
"assignment.change"
] | 1,000,621 | 1,000,622 | u422769833 | cpp |
p03208 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll k, n;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
sort(h.begin(), h.end());
ll ans = (int)pow(10, 10);... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll k, n;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
sort(h.begin(), h.end());
ll ans = (int)pow(10, 10);... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,000,629 | 1,000,630 | u491279738 | cpp |
p03208 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
long minh = 1000000000;
for (int i = 0; i <... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long h[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
long minh = 1000000000;
for (int i = 0; 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"
] | 1,000,635 | 1,000,636 | u089885969 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <math.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 ans = 1000000000;
for (int i = 0; i < N - K - 1; i++) {
int h_mm = h[i + K - 1] - h[i];
if (h_mm == 0... | #include <algorithm>
#include <iostream>
#include <math.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 ans = 1000000000;
for (int i = 0; i + K <= N; i++) {
int h_mm = h[i + K - 1] - h[i];
if (h_mm == 0) ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,000,642 | 1,000,643 | u969116807 | cpp |
p03208 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
const int M = 1e9;
int n, k, h[M], ans = 1e9;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
for (int i = 0; i ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
const int M = 1e5;
int n, k, h[M], ans = 1e9;
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
for (int i = 0; i ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,000,644 | 1,000,645 | u265768297 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
vector<long long> sum(N);
sum.push_back(0);
for (int i = 1; i < N; i++) {
sum.at(i) = sum.at(i - 1) + (h.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> h(N);
for (int i = 0; i < N; i++) {
cin >> h.at(i);
}
sort(h.begin(), h.end());
vector<long long> sum(N);
sum.push_back(0);
for (int i = 1; i < N; i++) {
sum.at(i) = sum.at(i - 1) + (h.a... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"call.remove",
"call.arguments.change"
] | 1,000,653 | 1,000,654 | u832995587 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
vector<int> n(a);
c = 1000000000;
for (int i = 0; i < a; i++) {
cin >> n[i];
}
sort(n.begin(), n.end());
for (int i = 0; i < a - b; i++) {
c = min(c, abs(n[i] - n[i + b]));
}
cout << c << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
vector<int> n(a);
c = 1000000000;
for (int i = 0; i < a; i++) {
cin >> n[i];
}
sort(n.begin(), n.end());
for (int i = 0; i < a - b + 1; i++) {
c = min(c, abs(n[i] - n[i + b - 1]));
// cout<<n[i]<<endl;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 1,000,659 | 1,000,660 | u902787159 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long tmp;
vector<long long> h;
for (long long i = 0; i < n; i++) {
cin >> tmp;
h.push_back(tmp);
}
sort(h.begin(), h.end());
// for(long i=0;i<n;i++){
// cout ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long tmp;
vector<long long> h;
for (long long i = 0; i < n; i++) {
cin >> tmp;
h.push_back(tmp);
}
sort(h.begin(), h.end());
// for(long i=0;i<n;i++){
// cout ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 1,000,671 | 1,000,672 | u314960567 | cpp |
p03208 | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int n, k;
int a[100005];
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
int min = 1000000005;
for (int i = 0; i < n - k; i++) {
if (a[i + k] - a[i] < min) {
... | #include <algorithm>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
int n, k;
int a[100005];
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
int min = 1000000005;
for (int i = 0; i < n - k + 1; i++) {
if (a[i + k - 1] - a[i] < m... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 1,000,678 | 1,000,679 | u379288456 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int k, n;
int h[100003];
int ans = 10000000000;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
for (int i = 0; i < n - k - 1; i++) {
ans = min(ans, h[i + k - 1] - h... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int k, n;
int h[100003];
int ans = 10000000000;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, h[i + k - 1] - h... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,000,682 | 1,000,681 | u519950235 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int k, n;
int h[100003];
int ans = 10000000000;
int main() {
cin >> n >> k;
for (int i = n; i < n; i++)
cin >> h[i];
sort(h, h + n);
for (int i = 0; i < n - k; i++) {
ans = min(ans, h[i + k] - h[i]);
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int k, n;
int h[100003];
int ans = 10000000000;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
for (int i = 0; i < n - k + 1; i++) {
ans = min(ans, h[i + k - 1] - h... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 1,000,683 | 1,000,681 | u519950235 | 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++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | [
"expression.operation.binary.add"
] | 1,000,686 | 1,000,687 | u319234342 | 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++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1e9)
#define PI (acos(-1))
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << ... | [
"expression.operation.binary.add"
] | 1,000,688 | 1,000,687 | u319234342 | cpp |
p03208 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"variable_declaration.type.change"
] | 1,000,692 | 1,000,693 | u511379665 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
vector<int> h(100010);
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
sort(h.begin(), h.begin() + N);
int ans = 1e9;
for (int i = 0; i < N - K; ++i) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout << ans << e... | #include <bits/stdc++.h>
using namespace std;
vector<int> h(100010);
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
sort(h.begin(), h.begin() + N);
int ans = 1e9;
for (int i = 0; i <= N - K; ++i) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout << ans << ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,694 | 1,000,695 | u318727472 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
vector<int> h(100010);
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
sort(h.begin(), h.begin() + N);
int ans = 1e9;
for (int i = 0; i < K; ++i) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout << ans << endl;... | #include <bits/stdc++.h>
using namespace std;
vector<int> h(100010);
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
sort(h.begin(), h.begin() + N);
int ans = 1e9;
for (int i = 0; i <= N - K; ++i) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout << ans << ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,696 | 1,000,695 | u318727472 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
vector<int> h(100010);
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
sort(h.begin(), h.end());
int ans = 1e9;
for (int i = 0; i < K; ++i) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> h(100010);
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; ++i) {
cin >> h[i];
}
sort(h.begin(), h.begin() + N);
int ans = 1e9;
for (int i = 0; i <= N - K; ++i) {
ans = min(ans, h[i + K - 1] - h[i]);
}
cout << ans << ... | [
"call.function.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,697 | 1,000,695 | u318727472 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> num(N);
for (int i = 0; i < N; i++) {
cin >> num[i];
}
sort(num.begin(), num.end());
long ans = num[K - 1] - num[0];
for (int i = 0; i < N - K; i++) {
ans = min(ans, num[i + K - 1] - num[i]);
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, K;
cin >> N >> K;
vector<long> num(N);
for (int i = 0; i < N; i++) {
cin >> num[i];
}
sort(num.begin(), num.end());
long ans = num[K - 1] - num[0];
for (int i = 0; i < N - K + 1; i++) {
ans = min(ans, num[i + K - 1] - num[i]);
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,700 | 1,000,701 | u833295869 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
std::cin >> n >> k;
std::vector<int> h(n);
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
sort(h.begin(), h.end());
int ans = INT_MAX;
for (int i = 0; i < n - k; i++) {
int tmp = h[i + k - 1] - h[i];
if (tmp < ans) {... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
std::cin >> n >> k;
std::vector<int> h(n);
for (int i = 0; i < n; i++) {
std::cin >> h[i];
}
sort(h.begin(), h.end());
int ans = INT_MAX;
for (int i = 0; i < n - k + 1; i++) {
int tmp = h[i + k - 1] - h[i];
if (tmp < an... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,702 | 1,000,703 | u240733151 | cpp |
p03208 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long int trees[n];
for (int i = 0; i < n; i++) {
cin >> trees[i];
}
sort(trees, trees + n);
long long int ans = 0;
for ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long int trees[n];
for (int i = 0; i < n; i++) {
cin >> trees[i];
}
sort(trees, trees + n);
long long int ans = 0;
for ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 1,000,706 | 1,000,707 | u179987763 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
priority_queue<int, vector<int>, greater<int>> que;
rep(i, n) { cin >> h[i]; }
sort(h.begin(), h.end());
int mi = INT_MAX;
rep(i, n - k) { mi = min(mi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
priority_queue<int, vector<int>, greater<int>> que;
rep(i, n) { cin >> h[i]; }
sort(h.begin(), h.end());
int mi = INT_MAX;
rep(i, n - k + 1) { mi = mi... | [
"expression.operation.binary.add"
] | 1,000,737 | 1,000,738 | u625741705 | cpp |
p03208 | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n, k;
long long *h = new long long[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
long long ans = LLONG_MAX;
for (int i = 0; i + k - 1 < n; i++) {
ans = min(ans, h[i + k ... | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long *h = new long long[n];
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h, h + n);
long long ans = LLONG_MAX;
for (int i = 0; i + k - 1 < n; i++) {
ans = min(ans, h[i + ... | [] | 1,000,745 | 1,000,746 | u110383054 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
long long n, k;
cin >> n >> k;
vector<long long> h(n);
rep(i, n)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
long long n, k;
cin >> n >> k;
vector<long long> h(n);
rep(i, n)... | [
"expression.operation.binary.add"
] | 1,000,747 | 1,000,748 | u631558039 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
long long n, k;
cin >> n >> k;
vector<long long> h(n);
rep(i, n)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#include <string>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
long long n, k;
cin >> n >> k;
vector<long long> h(n);
rep(i, n)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,000,749 | 1,000,748 | u631558039 | cpp |
p03208 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define mod 1000000007
using namespace std;
int main() {
int m, n, o = 0, i, j, k;
int sum = 0, range = 0;
// long long int m,n,o,i,j,k;
// vector <int> v;
// float f,g,h;
// char c,d;
// str... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define mod 1000000007
using namespace std;
int main() {
int m, n, o = 0, i, j, k;
int sum = 0, range = 0;
// long long int m,n,o,i,j,k;
// vector <int> v;
// float f,g,h;
// char c,d;
// str... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,750 | 1,000,751 | u763410402 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
cin >> K;
vector<int> v(N, 0);
for (int i = 0; i < N; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
int d_min = v[K - 1] - v[0];
for (int i = 1; i < N - K; ++i) {
int d = v[K + i - 1] - v[i];
if (d_min > d) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
cin >> K;
vector<int> v(N, 0);
for (int i = 0; i < N; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
int d_min = v[K - 1] - v[0];
for (int i = 1; i <= N - K; ++i) {
int d = v[K + i - 1] - v[i];
if (d_min > d) {... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,766 | 1,000,767 | u422389945 | cpp |
p03208 | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n... | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (int i = 0; i < n... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,768 | 1,000,769 | u853315291 | cpp |
p03208 | #include <algorithm>
#include <cstdio>
#include <functional>
#define MAX 100000
int main() {
int N, K;
long int h[MAX], ans[MAX];
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%ld", &h[i]);
}
std::sort(h, h + N, std::greater<int>());
for (int i = 0; i < N - K; i++) {
ans[i] = h[i]... | #include <algorithm>
#include <cstdio>
#include <functional>
#define MAX 100000
int main() {
int N, K;
long int h[MAX], ans[MAX];
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%ld", &h[i]);
}
std::sort(h, h + N, std::greater<int>());
for (int i = 0; i < N - K + 1; i++) {
ans[i] = ... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,770 | 1,000,771 | u721269623 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
ll ans = 1000000000;
sort(h.begin(), h.end());
for (int i = 0; i < n - 2; i++) {
ll mi = abs(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
ll ans = 1000000000;
sort(h.begin(), h.end());
for (int i = 0; i <= n - k; i++) {
ll mi = abs... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 1,000,777 | 1,000,778 | u666121874 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
fo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
fo... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,000,784 | 1,000,785 | u264265458 | cpp |
p03208 | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end());
ll ans = INFINITY;
for (int i = 0; i <= n - k + 1; i++)
ans = min(ans, abs(h[i +... | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
sort(h.begin(), h.end());
ll ans = 1e9;
for (int i = 0; i <= n - k; i++)
ans = min(ans, abs(h[i + k - 1] -... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,000,788 | 1,000,789 | u942714396 | 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 mi = 10000000000;
for (int i = 0; i < n - 2; i++) {
if (h[k + i - 1] - h[i] < mi) {
mi = h[k + i - 1] - h[i];
... | #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 mi = 10000000000;
for (int i = 0; i < n + 1 - k; i++) {
if (h[k + i - 1] - h[i] < mi) {
mi = h[k + i - 1] - h[i]... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,000,807 | 1,000,808 | u843292252 | cpp |
p03208 | #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, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
vector<int> diff(n - 1);
rep(i, n - 1) diff[i] = h[i + 1] - h[i];
// rep(i,n-1) co... | #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, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
vector<int> diff(n - 1);
rep(i, n - 1) diff[i] = h[i + 1] - h[i];
// rep(i,n-1) co... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,809 | 1,000,810 | u806149832 | cpp |
p03208 | #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, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
vector<int> diff(n - 1);
rep(i, n - 1) diff[i] = h[i + 1] - h[i];
// rep(i,n-1) co... | #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, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
vector<int> diff(n - 1);
rep(i, n - 1) diff[i] = h[i + 1] - h[i];
// rep(i,n-1) co... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 1,000,811 | 1,000,810 | u806149832 | cpp |
p03208 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const ll mod2 = 99... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const ll mod2 = 99... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,000,815 | 1,000,816 | u759721333 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int store[200007];
int n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
scanf("%d", &store[i]);
sort(store + 1, store + n + 1);
int small = inf;
for (int i = 1; i + k - 1 <= n; i++) {
small = min(small, store[i + 3... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int store[200007];
int n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
scanf("%d", &store[i]);
sort(store + 1, store + n + 1);
int small = inf;
for (int i = 1; i + k - 1 <= n; i++) {
small = min(small, store[i + k... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,000,817 | 1,000,818 | u945133959 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int store[107];
int n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
scanf("%d", &store[i]);
sort(store + 1, store + n + 1);
int small = inf;
for (int i = 1; i + k - 1 <= n; i++) {
small = min(small, store[i + 3 - ... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int store[200007];
int n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
scanf("%d", &store[i]);
sort(store + 1, store + n + 1);
int small = inf;
for (int i = 1; i + k - 1 <= n; i++) {
small = min(small, store[i + k... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,000,819 | 1,000,818 | u945133959 | cpp |
p03208 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
long long int lcm(long long int a, long long int b) {
long long int n;
n = a * b / __gcd(a, b);
return n;
}
using ll = long long int;
#define ci(a) cin >> a
#define co(a) cout << a << endl
#define gcd(a, b) __... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
long long int lcm(long long int a, long long int b) {
long long int n;
n = a * b / __gcd(a, b);
return n;
}
using ll = long long int;
#define ci(a) cin >> a
#define co(a) cout << a << endl
#define gcd(a, b) __... | [
"assignment.change"
] | 1,000,820 | 1,000,821 | u191594139 | cpp |
p03208 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
long long int lcm(long long int a, long long int b) {
long long int n;
n = a * b / __gcd(a, b);
return n;
}
using ll = long long int;
#define ci(a) cin >> a
#define co(a) cout << a << endl
#define gcd(a, b) __... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
long long int lcm(long long int a, long long int b) {
long long int n;
n = a * b / __gcd(a, b);
return n;
}
using ll = long long int;
#define ci(a) cin >> a
#define co(a) cout << a << endl
#define gcd(a, b) __... | [
"assignment.change"
] | 1,000,822 | 1,000,821 | u191594139 | cpp |
p03208 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
long long int lcm(long long int a, long long int b) {
long long int n;
n = a * b / __gcd(a, b);
return n;
}
using ll = long long int;
#define ci(a) cin >> a
#define co(a) cout << a << endl
#define gcd(a, b) __... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
long long int lcm(long long int a, long long int b) {
long long int n;
n = a * b / __gcd(a, b);
return n;
}
using ll = long long int;
#define ci(a) cin >> a
#define co(a) cout << a << endl
#define gcd(a, b) __... | [
"assignment.change"
] | 1,000,823 | 1,000,821 | u191594139 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
int min_diff = 1e9 + 1;
for (int i = 0; i < N - K; i++) {
int tmp = A[i + K - 1] -... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
int min_diff = 1e9 + 10;
for (int i = 0; i < N - K + 1; i++) {
int tmp = A[i + K -... | [
"literal.number.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,826 | 1,000,827 | u614217744 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<long long> H(N);
for (int i = 0; i < N; i++) {
std::cin >> H[i];
}
std::sort(std::begin(H), std::end(H));
long long ans = 100000000000000;
for (int i = 0; i < N - K; i++) {
ans =... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int N, K;
std::cin >> N >> K;
std::vector<long long> H(N);
for (int i = 0; i < N; i++) {
std::cin >> H[i];
}
std::sort(std::begin(H), std::end(H));
long long ans = 100000000000000;
for (int i = 0; i <= N - K; i++) {
ans ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,850 | 1,000,851 | u922974720 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1e9
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int,... | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long long int llint;
typedef pair<ll, ll> pa;
#define MM 1e9
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pair<int,... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 1,000,852 | 1,000,853 | u342051078 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main() {
ll n, k;
cin >> n >> k;
ll h[n];
ll mx = 0, mn = INF;
for (ll i = 0; i < n; i++) {
cin >> h[i];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main() {
ll n, k;
cin >> n >> k;
ll h[n];
ll mx = 0, mn = INF;
for (ll i = 0; i < n; i++) {
cin >> h[i];
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,854 | 1,000,855 | u342051078 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main() {
ll n, k;
cin >> n >> k;
ll h[n];
ll mx = 0, mn = INF;
for (ll i = 0; i < n; i++) {
cin >> h[i];
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MM = 1000000000;
#define mod = MM + 7;
#define INF (ll)1e18
#define pi acos(-1.0)
#define MAX 10000000005
#define NIL -1
int main() {
ll n, k;
cin >> n >> k;
ll h[n];
ll mx = 0, mn = INF;
for (ll i = 0; i < n; i++) {
cin >> h[i];
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,000,856 | 1,000,855 | u342051078 | cpp |
p03208 | #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, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
ll ans = pow(1, 9) + 1;
for (int i = k - 1; i < n; i++) {
ans = min(ans, h[i] - ... | #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, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
ll ans = pow(10, 9) + 1;
for (int i = k - 1; i < n; i++) {
ans = min(ans, h[i] -... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,000,859 | 1,000,860 | u835561357 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
const int INF = 1 << 30;
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.b... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
const int INF = 1 << 30;
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.b... | [
"expression.operation.binary.add"
] | 1,000,863 | 1,000,864 | u539199630 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
const int INF = 1 << 30;
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.b... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
const int INF = 1 << 30;
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> h(n);
rep(i, n) cin >> h[i];
sort(h.b... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,000,865 | 1,000,864 | u539199630 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans = 1000000000;
cin >> N >> K;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - K; i++) {
ans = min(ans, vec[i + K - 1] - vec[i]);
}
cout << ans <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, ans = 1000000000;
cin >> N >> K;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - K + 1; i++) {
ans = min(ans, vec[i + K - 1] - vec[i]);
}
cout << an... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,000,890 | 1,000,891 | u926416331 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define ppi pair<int, int>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define ff first
#define ss secon... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define ppi pair<int, int>
#define ppl pair<ll, ll>
#define all(x) x.begin(), x.end()
#define ii int, int
#define ff first
#define ss secon... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 1,000,899 | 1,000,900 | u460819600 | cpp |
p03208 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD = 1e9 + 7;
int main() {
i... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD = 1e9 + 7;
int main() {
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"
] | 1,000,903 | 1,000,904 | u117615163 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (auto &e : h)
cin >> e;
sort(begin(h), end(h));
int r = 1e9;
for (int i = 0; i + k - 1 < n; i++)
r = max(r, h[i + k - 1] - h[i]);
cout << r << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
for (auto &e : h)
cin >> e;
sort(begin(h), end(h));
int r = 1e9;
for (int i = 0; i + k - 1 < n; i++)
r = min(r, h[i + k - 1] - h[i]);
cout << r << endl;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,000,910 | 1,000,911 | u848737670 | cpp |
p03208 | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | /******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
******************************************... | [
"expression.unary.arithmetic.add"
] | 1,000,916 | 1,000,917 | u205158303 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> h;
long long l;
for (int i = 0; i < n; i++) {
cin >> l;
h.push... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> h;
long long l;
for (int i = 0; i < n; i++) {
cin >> l;
h.push... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,932 | 1,000,933 | u355911860 | cpp |
p03208 | #include <bits/stdc++.h>
#include <chrono>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
#define f first
#define s second
typedef long long ll;
using namespace std;
const int N = 1e5;
int a[N + 5];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int ... | #include <bits/stdc++.h>
#include <chrono>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define eps 1e-9
#define f first
#define s second
typedef long long ll;
using namespace std;
const int N = 1e5;
int a[N + 5];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int ... | [
"control_flow.loop.for.condition.change"
] | 1,000,942 | 1,000,943 | u409343817 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
typedef long long ll;
cons... | [] | 1,000,951 | 1,000,952 | u995725911 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define For(i, a, b) for (i = a; i < b; i++)
#define rep(i, N) For(i, 0, N)
#define rep1(i, N) For(i, 1, N)
#define all(v) (v).begin(), (v).end()
#define vsort(v) sort(all(v))
#define mod 1000000007
usin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define For(i, a, b) for (i = a; i < b; i++)
#define rep(i, N) For(i, 0, N)
#define rep1(i, N) For(i, 1, N)
#define all(v) (v).begin(), (v).end()
#define vsort(v) sort(all(v))
#define mod 1000000007
usin... | [
"expression.unary.arithmetic.add"
] | 1,000,966 | 1,000,967 | u251847465 | cpp |
p03208 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
ll h[2 * 100000 + 1];
cin >> n >> k;
k--;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
ll ans = n;
for (int i = 0; i < n - k; i++) {
ans = min(ans, -h[i] + h[i + k]);
}
cout << ans <<... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
ll h[2 * 100000 + 1];
cin >> n >> k;
k--;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
ll ans = 1000000000;
for (int i = 0; i < n - k; i++) {
ans = min(ans, -h[i] + h[i + k]);
}
cout ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,000,968 | 1,000,969 | u445015174 | cpp |
p03208 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, k;
ll h[2 * 100000 + 1];
cin >> n >> k;
k--;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
ll ans = n;
for (int i = 0; i < n - k; i++) {
ans = min(ans, -h[i] + h[i + k]);
}
cout << ans <... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll n, k;
ll h[2 * 100000 + 1];
cin >> n >> k;
k--;
for (int i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n);
ll ans = 1000000000;
for (int i = 0; i < n - k; i++) {
ans = min(ans, -h[i] + h[i + k]);
}
cout ... | [
"variable_declaration.type.change",
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,000,970 | 1,000,969 | u445015174 | cpp |
p03208 | /*Shivam Bhalla */
/* f2016941@pilani.bits-pilani.ac.in */
#include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#inc... | /*Shivam Bhalla */
/* f2016941@pilani.bits-pilani.ac.in */
#include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#inc... | [
"control_flow.branch.else.remove"
] | 1,000,981 | 1,000,982 | u395652671 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iostream>
#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 ans = 1000000000;
for (int i = 0; i < n - k; i++) {
ans = min(ans, abs(... | #include <algorithm>
#include <cmath>
#include <iostream>
#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 ans = 1000000001;
for (int i = 0; i <= n - k; i++) {
ans = min(ans, abs... | [
"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,989 | 1,000,990 | u293511800 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iostream>
#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 ans = 1000000001;
for (int i = 0; i < n - k; i++) {
ans = min(ans, abs(... | #include <algorithm>
#include <cmath>
#include <iostream>
#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 ans = 1000000001;
for (int i = 0; i <= n - k; i++) {
ans = min(ans, abs... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,000,991 | 1,000,990 | u293511800 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#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 ans = (int)1e9;
for (int i = 0; i < (N - K); i++)
ans = min(ans, h[i + K - 1] - h[i]);
... | #include <algorithm>
#include <iostream>
#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 ans = (int)1e9;
for (int i = 0; i <= (N - K); i++)
ans = min(ans, h[i + (K - 1)] - h[i]);... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,000,996 | 1,000,997 | u633402865 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; i++)
cin >> h[i];
sort(h, h + N);
int ans = 1e9;
for (int i = 0; i < N - K; i++) {
ans = min(h[i + K] - h[i], ans);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, K;
cin >> N >> K;
int h[N];
for (int i = 0; i < N; i++)
cin >> h[i];
sort(h, h + N);
int ans = 1e9;
for (int i = 0; i <= N - K; i++) {
ans = min(h[i + K - 1] - h[i], ans);
}
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 1,001,002 | 1,001,003 | u998251394 | cpp |
p03208 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define in insert
#define all(x) (x).begin(), (x).end()
#define speed ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define in insert
#define all(x) (x).begin(), (x).end()
#define speed ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.change"
] | 1,001,004 | 1,001,005 | u843739531 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int n, k, h[100000], ans = 1000000000;
cin >> n >> k;
for (int a = 0; a < n; a++)
cin >> h[a];
sort(h, h + n);
for (int i = n - 1; i > 0; i--) {
if (h[i] - h[i - k + 1] < an... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int n, k, h[100000], ans = 1000000000;
cin >> n >> k;
for (int a = 0; a < n; a++)
cin >> h[a];
sort(h, h + n);
for (int i = n - 1; i >= k - 1; i--) {
if (h[i] - h[i - k + 1]... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,001,017 | 1,001,018 | u003026289 | cpp |
p03208 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int n, k, h[100000], ans = 1000000000;
cin >> n >> k;
for (int a = 0; a < n; a++)
cin >> h[a];
sort(h, h + n);
for (int i = n - 1; i > 0; i--) {
if (h[i] - h[i - k + 1] < an... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int n, k, h[100000], ans = 1000000000;
cin >> n >> k;
for (int a = 0; a < n; a++)
cin >> h[a];
sort(h, h + n);
for (int i = n - 1; i > k - 2; i--) {
if (h[i] - h[i - k + 1] ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,001,017 | 1,001,019 | u003026289 | 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 d = 1000000001;
for (int i = 0; i < n - k - 1; i++) {
d = min(d, h[i + k - 1] - h[i]);
}
cout << d << 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 d = 1000000001;
for (int i = 0; i < n - k + 1; i++) {
d = min(d, h[i + k - 1] - h[i]);
}
cout << d << endl;
} | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,001,020 | 1,001,021 | u244626757 | cpp |
p03208 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int ans = 1e9;
for (int i = 0; i < n - k; ++i) {
int L ... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.begin(), a.end());
int ans = 1e9;
for (int i = 0; i < n - k + 1; ++i) {
in... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,001,034 | 1,001,035 | u953753178 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.