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 |
|---|---|---|---|---|---|---|---|
p03102 | #include <iostream>
using namespace std;
long long calc(const int A[], const int B[], int N) {
long long sum = 0;
for (int i = 0; i < N; i++) {
// cout << "A*B: " << A[i] * B[i] << endl;
sum += A[i] * B[i];
}
// cout << "sum: " << sum << endl;
return sum;
}
int main(int argc, char const *argv[]) {
... | #include <iostream>
using namespace std;
long long calc(const int A[], const int B[], int N) {
long long sum = 0;
for (int i = 0; i < N; i++) {
sum += A[i] * B[i];
}
return sum;
}
int main(int argc, char const *argv[]) {
int N, M, C, ret = 0;
cin >> N >> M >> C;
int B[M], A[N][M];
for (int i =... | [
"variable_declaration.type.primitive.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 909,815 | 909,813 | u481487723 | cpp |
p03102 | #include <cstdio>
#include <iostream>
using namespace std;
int n, m, c;
int a[25][25];
int b[25];
int main() {
int cnt = 0;
scanf("%d%d%d", &n, &m, &c);
for (int i = 1; i <= m; i++)
scanf("%d", &b[i]);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
}
}
... | #include <cstdio>
#include <iostream>
using namespace std;
int n, m, c;
int a[25][25];
int b[25];
int main() {
int cnt = 0;
scanf("%d%d%d", &n, &m, &c);
// cout<<"c="<<c<<endl;
for (int i = 1; i <= m; i++)
scanf("%d", &b[i]);
// for(int i=1;i<=m;i++)
// cout<<b[i]<<" ";
// cout<<endl;
for (int i =... | [
"assignment.value.change",
"assignment.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 909,818 | 909,819 | u276626173 | cpp |
p03102 | #include <bits/stdc++.h>
#define inf 1 << 30
#define p5 100007
#define p6 1000007
#define PI acos(-1)
#define M 1000000007
#define sc scanf
#define ss second
#define ff first
#define pf printf
#define scin(x) sc("%d", &(x))
#define scin2(x, y) sc("d", &(x), &(y))
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) ... | #include <bits/stdc++.h>
#define inf 1 << 30
#define p5 100007
#define p6 1000007
#define PI acos(-1)
#define M 1000000007
#define sc scanf
#define ss second
#define ff first
#define pf printf
#define scin(x) sc("%d", &(x))
#define scin2(x, y) sc("d", &(x), &(y))
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) ... | [
"assignment.change"
] | 909,826 | 909,827 | u668288277 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
int b[m], a[n][m];
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> a[i][m];
}
}
for (int i = 0; i < n; ++i) {
long long int d ... | #include <iostream>
using namespace std;
int main() {
int n, m, c, ans = 0;
cin >> n >> m >> c;
int b[m], a[n][m];
for (int i = 0; i < m; ++i)
cin >> b[i];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; ++i) {
long long int d ... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 909,828 | 909,829 | u021083776 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C, sum, ans = 0;
cin >> N >> M >> C;
int B[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
int A[N][M];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
for (int i = 0; i < N; i++) {
... | #include <iostream>
using namespace std;
int main() {
int N, M, C, sum, ans = 0;
cin >> N >> M >> C;
int B[M];
for (int i = 0; i < M; i++) {
cin >> B[i];
}
int A[N][M];
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
cin >> A[i][j];
}
}
for (int i = 0; i < N; i++) {
... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,833 | 909,834 | u274317341 | cpp |
p03102 | #include <iostream>
using namespace std;
int main() {
int N, M, C;
int A[21][21] = {0};
int B[21] = {0};
int count;
int right = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; ++i) {
cin >> B[i];
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < M; ++j) {
cin >> A[i][j];
}
}
... | #include <iostream>
using namespace std;
int main() {
int N, M, C;
int A[21][21] = {0};
int B[21] = {0};
int count;
int right = 0;
cin >> N >> M >> C;
for (int i = 0; i < M; ++i) {
cin >> B[i];
}
for (int i = 0; i < N; ++i) {
for (int j = 0; j < M; ++j) {
cin >> A[i][j];
}
}
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 909,835 | 909,836 | u318150500 | cpp |
p03102 | #include <algorithm>
#include <cstdio>
int main(int argc, char const *argv[]) {
int n, m, c;
scanf("%d %d %d", &n, &m, &c);
int a[n][m];
int b[m];
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}... | #include <algorithm>
#include <cstdio>
int main(int argc, char const *argv[]) {
int n, m, c;
scanf("%d %d %d", &n, &m, &c);
int a[n][m];
int b[m];
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 909,837 | 909,838 | u117345342 | cpp |
p03102 | #include <algorithm>
#include <cstdio>
int main(int argc, char const *argv[]) {
int n, m, c;
scanf("%d %d %d", &n, &m, &c);
int a[n][m];
int b[m];
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}... | #include <algorithm>
#include <cstdio>
int main(int argc, char const *argv[]) {
int n, m, c;
scanf("%d %d %d", &n, &m, &c);
int a[n][m];
int b[m];
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &a[i][j]);
}
}... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 909,839 | 909,838 | u117345342 | cpp |
p03102 | #include <stdio.h>
using namespace std;
int main() {
int n, m, c, totl = 0;
int b[30], a;
scanf("%d%d%d", &n, &m, &c);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
scanf("%d", &a);
sum += a * b[j];
}... | #include <stdio.h>
using namespace std;
int main() {
int n, m, c, totl = 0;
int b[30], a;
scanf("%d%d%d", &n, &m, &c);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = 0; j < m; j++) {
scanf("%d", &a);
sum += a * b[j];
}... | [
"assignment.add"
] | 909,842 | 909,843 | u684491393 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#... | [] | 909,849 | 909,850 | u013750540 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
int C;
cin >> N >> M >> C;
vector<int> vec(M);
int B;
for (int x = 0; x < M; x++) {
// int B;
cin >> B;
vec.at(x) = B;
}
// cout << vec.at(0) << endl;
long answer;
long chech;
long nyuryoku;
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
int C;
cin >> N >> M >> C;
vector<int> vec(M);
int B;
for (int x = 0; x < M; x++) {
cin >> B;
vec.at(x) = B;
}
long answer = 0;
long chech;
long nyuryoku;
for (int y = 0; y < N; y++) {
chech = 0;
fo... | [
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 909,860 | 909,861 | u813182149 | cpp |
p03102 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> B(m);
for (int i = 0; i < m; i++) {
cin >> B[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
vector<int> a(m);
int sum = c;
for (int j = 0; j < m; j++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m, c;
cin >> n >> m >> c;
vector<int> B(m);
for (int i = 0; i < m; i++) {
cin >> B[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
vector<int> a(m);
int sum = c;
for (int j = 0; j < m; j++) {
... | [] | 909,879 | 909,880 | u568419568 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n"... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n"... | [] | 909,885 | 909,886 | u184572586 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
map<int, int> d;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
d[A] = B;
}
long long int ans = 0;
for (auto [A, B] : d) {
long long int b = min(M, B);
ans += A... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
map<int, int> d;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
d[A] += B;
}
long long int ans = 0;
for (auto [A, B] : d) {
long long int b = min(M, B);
ans += ... | [
"assignment.value.change"
] | 909,889 | 909,890 | u879226168 | cpp |
p03103 | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#inclu... | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#inclu... | [
"variable_declaration.type.change"
] | 909,893 | 909,894 | u290006620 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> ab;
rep(i, n) {
ll a, b;
cin >> a >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> ab;
rep(i, n) {
ll a, b;
cin >> a >... | [
"expression.unary.arithmetic.remove"
] | 909,907 | 909,908 | u119171625 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(N);
vector<int> b(N);
for (int i = 0; i < N; i++) {
cin >> a[i] >> b[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i] = make_pair(a[i], b[i]);
}
sort(AB.begin(), AB.beg... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a(N);
vector<int> b(N);
for (int i = 0; i < N; i++) {
cin >> a[i] >> b[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i] = make_pair(a[i], b[i]);
}
sort(AB.begin(), AB.end... | [
"call.function.change",
"call.arguments.change"
] | 909,923 | 909,924 | u896053584 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | [
"control_flow.loop.for.condition.change",
"assignment.value.change",
"call.arguments.change"
] | 909,925 | 909,926 | u946082956 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | #include <bits/stdc++.h>
using namespace std;
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a... | [
"assignment.value.change",
"call.arguments.change"
] | 909,927 | 909,926 | u946082956 | cpp |
p03103 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%d\n", n)
#define pff(a, b) printf("%d %d\n", a, b);
typedef lo... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pf(n) printf("%lld\n", n)
#define pff(a, b) printf("%d %d\n", a, b);
typedef ... | [
"preprocessor.define.value.change"
] | 909,932 | 909,933 | u770486670 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n, m;
cin >> n >> m;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
int ia, ib;
cin >> ia >> ib;
a[i] = make_pair(ia, ib);
}
sort(a.begin(), a.end());
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> a(n);
for (int i = 0; i < n; i++) {
int ia, ib;
cin >> ia >> ib;
a[i] = make_pair(ia, ib);
}
sort(a.begin(), a.end());
ll... | [
"variable_declaration.type.change"
] | 909,939 | 909,940 | u288035794 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N, M;
scanf("%d %d", &N, &M);
pair<int, int> shops[100100];
for (int i = 0; i < N; i++) {
int A, B;
scanf("%d %d", &A, &B);
shops[i] = make_pair(A, B);
}
sort(shops, shops + N);
long long ans... | #include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int N, M;
scanf("%d %d", &N, &M);
pair<int, int> shops[100100];
for (int i = 0; i < N; i++) {
int A, B;
scanf("%d %d", &A, &B);
shops[i] = make_pair(A, B);
}
sort(shops, shops + N);
long long ans... | [
"type_conversion.add"
] | 909,941 | 909,942 | u684448032 | cpp |
p03103 | #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
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | #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
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | [] | 909,943 | 909,944 | u633066470 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> drink(N);
for (int i = 0; i < N; i++)
cin >> drink[i].first >> drink[i].second;
sort(drink.begin(), drink.end());
ll ans = 0;
for (int i = 0; i < N; i++) {
if (drink[i]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<pair<ll, ll>> drink(N);
for (int i = 0; i < N; i++)
cin >> drink[i].first >> drink[i].second;
sort(drink.begin(), drink.end());
ll ans = 0;
for (int i = 0; i < N; i++) {
if (drink[i].s... | [] | 909,949 | 909,950 | u986480146 | cpp |
p03103 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i].first >> d[i].second;
}
sort(all(d));
ll ans = 0;
for (int ... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i].first >> d[i].second;
}
sort(all(d));
ll ans = 0;
for (int i =... | [
"variable_declaration.type.change"
] | 909,955 | 909,956 | u654240084 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pa(n);
for (int i = 0; i < n; i++) {
cin >> pa[i].first >> pa[i].second;
}
sort(pa.begin(), pa.end());
int ans = 0;
for (int i = 0; i < n; i++) {
if (pa[i].second... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> pa(n);
for (ll i = 0; i < n; i++) {
cin >> pa[i].first >> pa[i].second;
}
sort(pa.begin(), pa.end());
ll ans = 0;
for (ll i = 0; i < n; i++) {
if (pa[i].second < m) ... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 909,959 | 909,960 | u221391729 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int ans = 0;
long long int m, n, a, b;
cin >> n >> m;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back(make_pair(a, b));
}
sort(v.begin(), v.... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int ans = 0;
long long m, n, a, b;
cin >> n >> m;
vector<pair<long long, long long>> v;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back(make_pair(a, b));
}
sort(v.beg... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 909,961 | 909,962 | u861658976 | cpp |
p03103 | //#pragma GCC target("avx2")
//#pragma GCC optimization("O3")
//#pragma GCC optimization("unroll-loops")
// assert(q==w) если q!=w --> runtime error
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define ub upper_bound
#define lb lower_bound
#define bit... | //#pragma GCC target("avx2")
//#pragma GCC optimization("O3")
//#pragma GCC optimization("unroll-loops")
// assert(q==w) если q!=w --> runtime error
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define ub upper_bound
#define lb lower_bound
#define bit... | [
"variable_declaration.type.change"
] | 909,963 | 909,964 | u863370423 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> p;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
p.push_back(make_pair(a, b));
}
sort(p.begin(), p.end());
long long cnt = 0, price = 0;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> p;
long long a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
p.push_back(make_pair(a, b));
}
sort(p.begin(), p.end());
long long cnt = 0, price = 0;
for (int i = 0; i < n; i++) ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 909,967 | 909,968 | u569361260 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int64_t, int64_t>> vec(N);
for (int i = 0; i < N; i++) {
int64_t O, P;
cin >> O >> P;
vec.at(i) = make_pair(O, P);
}
sort(vec.begin(), vec.end());
int64_t total = 0;
int64_t ans = 0;
int i = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int64_t, int64_t>> vec(N);
for (int i = 0; i < N; i++) {
int64_t O, P;
cin >> O >> P;
vec.at(i) = make_pair(O, P);
}
sort(vec.begin(), vec.end());
int64_t total = 0;
int64_t ans = 0;
int i = 0;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 909,973 | 909,974 | u538283043 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int64_t, int64_t>> vec(N);
for (int i = 0; i < N; i++) {
int64_t O, P;
cin >> O >> P;
vec.at(i) = make_pair(O, P);
}
sort(vec.begin(), vec.end());
int64_t total = 0;
int64_t ans = 0;
int i = 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int64_t, int64_t>> vec(N);
for (int i = 0; i < N; i++) {
int64_t O, P;
cin >> O >> P;
vec.at(i) = make_pair(O, P);
}
sort(vec.begin(), vec.end());
int64_t total = 0;
int64_t ans = 0;
int i = 0;... | [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 909,975 | 909,974 | u538283043 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
int INF = 1e9 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
int N, M;
cin >> N >> M;
vector<P> AB(N);
for (int i = 0; i < N; i++) {
cin >> AB[i].first >> AB[i].second;
}
sort(AB.begin(), ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e9 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
int N, M;
cin >> N >> M;
vector<P> AB(N);
for (int i = 0; i < N; i++) {
cin >> AB[i].first >> AB[i].second... | [
"variable_declaration.type.primitive.change"
] | 909,976 | 909,977 | u237390401 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<long long, long long>> a(n);
for (int i = 0; i < n; i++) {
int a1, a2;
cin >> a1 >> a2;
a.at(i) = make_pair(a1, a2);
}
sort(a.begin(), a.end());
long long k = 0, h = 0;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<long long, long long>> a(n);
for (int i = 0; i < n; i++) {
int a1, a2;
cin >> a1 >> a2;
a.at(i) = make_pair(a1, a2);
}
sort(a.begin(), a.end());
long long k = 0, h = 0;
for (int i = 0; i < n; i++... | [
"assignment.value.change",
"identifier.change"
] | 909,980 | 909,981 | u323864528 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<long long, long long>> a(n);
for (int i = 0; i < n; i++) {
int a1, a2;
cin >> a1 >> a2;
a.at(i) = make_pair(a1, a2);
}
sort(a.begin(), a.end());
long long k = 0, h = 0;
for (int i = 0; i < n; i++... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<long long, long long>> a(n);
for (int i = 0; i < n; i++) {
int a1, a2;
cin >> a1 >> a2;
a.at(i) = make_pair(a1, a2);
}
sort(a.begin(), a.end());
long long k = 0, h = 0;
for (int i = 0; i < n; i++... | [
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change"
] | 909,982 | 909,981 | u323864528 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long k;
cin >> k;
map<long long, long long> map1;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
long long b;
cin >> b;
map1.insert(pair<long long, long long>(a, b));
}
long long ans =... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long k;
cin >> k;
multimap<long long, long long> map1;
for (long long i = 0; i < n; i++) {
long long a;
cin >> a;
long long b;
cin >> b;
map1.insert(pair<long long, long long>(a, b));
}
long long ... | [
"variable_declaration.type.change"
] | 909,985 | 909,986 | u616038992 | cpp |
p03103 | #include <bits/stdc++.h>
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
int main() {
int ... | #include <bits/stdc++.h>
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
int main() {
int ... | [
"type_conversion.add"
] | 909,994 | 909,995 | u849151695 | cpp |
p03103 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdlib.h>
#include <st... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdlib.h>
#include <st... | [
"variable_declaration.type.change"
] | 909,996 | 909,997 | u586052522 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
map<long long, long long> kaz;
for (int i = 0; i < N; i++) {
long long a, b;
cin >> a >> b;
kaz[a] = b;
}
long long sum = 0;
for (auto &x : kaz) {
if (x.second < M) {
sum += x.first * x.second... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
map<long long, long long> kaz;
for (int i = 0; i < N; i++) {
long long a, b;
cin >> a >> b;
kaz[a] += b;
}
long long sum = 0;
for (auto &x : kaz) {
if (x.second < M) {
sum += x.first * x.secon... | [
"assignment.value.change"
] | 910,004 | 910,005 | u642497480 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | [
"variable_declaration.type.change"
] | 910,014 | 910,015 | u852862907 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 910,016 | 910,017 | u852862907 | cpp |
p03103 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define co(n) cout << n << endl
#define all(n) (n).begin(), (n).end()
#define pb(n, m) n.push_back(m)
#define pi(n, m) n.insert(n.begin(), m);
#define ee(n) n.erase(n.end() - 1)
#define eb(n) n.erase(... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define co(n) cout << n << endl
#define all(n) (n).begin(), (n).end()
#define pb(n, m) n.push_back(m)
#define pi(n, m) n.insert(n.begin(), m);
#define ee(n) n.erase(n.end() - 1)
#define eb(n) n.erase(... | [
"variable_declaration.type.change"
] | 910,029 | 910,030 | u558115145 | cpp |
p03103 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = ... | [
"variable_declaration.type.change"
] | 910,034 | 910,035 | u366581326 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> p(n);
for (int i = 0; i < n; ++i)
cin >> p[i].first >> p[i].second;
sort(p.begin(), p.end());
long long ans = 0;
for (int i = 0; i < n; ++i) {
int buy = min(m, p[i].second);
ans += buy ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> p(n);
for (int i = 0; i < n; ++i)
cin >> p[i].first >> p[i].second;
sort(p.begin(), p.end());
long long ans = 0;
for (int i = 0; i < n; ++i) {
long long buy = min(m, p[i].second);
ans +... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,046 | 910,047 | u348398921 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef vector<pii> vii;
typedef vector<pl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef vector<pii> vii;
typedef vector<pl... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 910,054 | 910,055 | u688862905 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M, wa = 0, hako = 0, las = 0;
cin >> N >> M;
vector<vector<long long>> A(N, vector<long long>(2));
for (int i = 0; i < N; i++) {
cin >> A.at(i).at(0) >> A.at(i).at(1);
}
sort(A.begin(), A.end());
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M, wa = 0, hako = 0, las = 0;
cin >> N >> M;
vector<vector<long long>> A(N, vector<long long>(2));
for (int i = 0; i < N; i++) {
cin >> A.at(i).at(0) >> A.at(i).at(1);
}
sort(A.begin(), A.end());
for (int i = 0; i < N; i++) {... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,072 | 910,073 | u799751074 | cpp |
p03103 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
rep(i, n) cin >> a[i] >> b[i];
vector<pa... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
vector<pa... | [] | 910,074 | 910,075 | u448922807 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair... | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define pi 3.141592653589793
#define eps 0.00000001
#define INF 1e9 + 7
using ll = long long;
using P = pair<int, int>;
using lP = pair<ll, ll>;
using fP = pair... | [
"type_conversion.add"
] | 910,079 | 910,080 | u395287054 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
vector<pair<long long int, long long int>> mise(N);
for (int i = 0; i < M; i++) {
cin >> mise[i].first >> mise[i].second;
}
sort(mise.begin(), mise.end());
long long int okane = 0;
long long int honsuu = 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
vector<pair<long long int, long long int>> mise(N);
for (long long int i = 0; i < N; i++) {
cin >> mise[i].first >> mise[i].second;
}
sort(mise.begin(), mise.end());
long long int okane = 0;
long long int ... | [
"control_flow.loop.for.initializer.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 910,083 | 910,084 | u406647332 | cpp |
p03103 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [
"assignment.value.change"
] | 910,087 | 910,088 | u516525290 | cpp |
p03103 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [
"assignment.value.change",
"call.add",
"call.arguments.change"
] | 910,089 | 910,088 | u516525290 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | [
"control_flow.break.add"
] | 910,090 | 910,091 | u340010271 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | [
"variable_declaration.type.change"
] | 910,092 | 910,091 | u340010271 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll n, m;
cin >> n >> m;
map<ll, ll> ma;
rep(i, n) {
int a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll n, m;
cin >> n >> m;
map<ll, ll> ma;
rep(i, n) {
int a,... | [
"assignment.value.change"
] | 910,098 | 910,099 | u459025138 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll n, m;
cin >> n >> m;
map<ll, ll> ma;
rep(i, n) {
int a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll n, m;
cin >> n >> m;
map<ll, ll> ma;
rep(i, n) {
int a,... | [
"assignment.value.change"
] | 910,100 | 910,099 | u459025138 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
int n, m;
cin >> n >> m;
map<int, int> ma;
rep(i, n) {
int... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define contains(v, t) (find(v.begin(), v.end(), t) != v.end())
#define MOD 1000000007
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll n, m;
cin >> n >> m;
map<ll, ll> ma;
rep(i, n) {
int a,... | [
"variable_declaration.type.change",
"assignment.value.change"
] | 910,101 | 910,099 | u459025138 | cpp |
p03103 | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | // Jai Bhole Ki
#include <bits/stdc++.h>
using namespace std;
#define fast \
static int fastline = []() { \
std::ios::sync_with_stdio(false); \
cin.tie(NUL... | [
"assignment.value.change"
] | 910,102 | 910,103 | u526639495 | cpp |
p03103 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> ab(n);
rep(i, n) {
int a, b;
cin >> a >> b;
ab[i].first = a;
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> ab(n);
rep(i, n) {
ll a, b;
cin >> a >> b;
ab[i].first = a;
... | [
"variable_declaration.type.change"
] | 910,109 | 910,110 | u531461815 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
pair<int, int> d[n];
for (int i = 0; i < n; i++)
cin >> d[i].first >> d[i].second;
sort(d, d + n);
long long sum = 0;
for (int i = 0; m > 0; i++) {
if (m >= d[i].second) {
sum += d[i].second * d[i].first;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
pair<long long, long long> d[n];
for (int i = 0; i < n; i++)
cin >> d[i].first >> d[i].second;
sort(d, d + n);
long long sum = 0;
for (int i = 0; m > 0; i++) {
if (m >= d[i].second) {
sum += d[i].second * d[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,115 | 910,116 | u297195722 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
pair<int, int> d[n];
for (int i = 0; i < n; i++)
cin >> d[i].first >> d[i].second;
sort(d, d + n);
long long sum = 0;
for (int i = 0; m > 0; i++) {
if (m >= d[i].second) {
sum += d[i].second * d[i].first;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
pair<long long, long long> d[n];
for (int i = 0; i < n; i++)
cin >> d[i].first >> d[i].second;
sort(d, d + n);
long long sum = 0;
for (int i = 0; m > 0; i++) {
if (m >= d[i].second) {
sum += d[i].second * d[i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 910,117 | 910,116 | u297195722 | cpp |
p03103 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <uno... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <uno... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,118 | 910,119 | u840713046 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> ab(n, vector<int>(2));
for (int i = 0; i < n; i++) {
cin >> ab[i][0] >> ab[i][1];
}
sort(ab.begin(), ab.end());
int ans = 0;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int main() {
ll n, m;
cin >> n >> m;
vector<vector<ll>> ab(n, vector<ll>(2));
for (ll i = 0; i < n; i++) {
cin >> ab[i][0] >> ab[i][1];
}
sort(ab.begin(), ab.end());
ll ans = 0;
for ... | [
"variable_declaration.type.change",
"call.arguments.change",
"control_flow.loop.for.initializer.change"
] | 910,126 | 910,127 | u476027087 | cpp |
p03103 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int n, m;
cin >> n >> m;
P memo[n];
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
memo[i] = make_pair(a, b);
}
sort(memo, memo + n);
... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
ll n, m;
cin >> n >> m;
llP memo[n];
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
memo[i] = make_pair(a, b);
}
sort(memo, memo + n);
... | [
"variable_declaration.type.change"
] | 910,132 | 910,133 | u201553784 | cpp |
p03103 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int n, m;
cin >> n >> m;
P memo[m];
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
memo[i] = make_pair(a, b);
}
sort(memo, memo + n);
... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
ll n, m;
cin >> n >> m;
llP memo[n];
for (int i = 0; i < n; i++) {
ll a, b;
cin >> a >> b;
memo[i] = make_pair(a, b);
}
sort(memo, memo + n);
... | [
"variable_declaration.type.change",
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 910,134 | 910,133 | u201553784 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
int main() {
int n, m;
cin >> n >> m;
vector<pii> x(n);
rep(i, n) {
ll a, b;
cin >> a >> b;
x[i].first = a;
x[i].second = b;
}
ll ans = 0;
sort(x.b... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
int main() {
int n, m;
cin >> n >> m;
vector<pii> x(n);
rep(i, n) {
ll a, b;
cin >> a >> b;
x[i].first = a;
x[i].second = b;
}
ll ans = 0;
sort(x.b... | [
"control_flow.break.add"
] | 910,139 | 910,140 | u816145694 | cpp |
p03103 | #include <algorithm>
#include <cctype>
#include <iostream>
#include <math.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> d(n);
rep(i, n) {
int a, b... | #include <algorithm>
#include <cctype>
#include <iostream>
#include <math.h>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<ll, int>> d(n);
rep(i, n) {
int a, b;... | [] | 910,141 | 910,142 | u745267317 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
long long ans = 0;
cin >> n >> m;
vector<pair<int, int>> AB(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
AB[i] = make_pair(a, b);
}
sort(AB.begin(), AB.end());
for (int i = 0... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
long long ans = 0;
cin >> n >> m;
vector<pair<long long, long long>> AB(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
AB[i] = make_pair(a, b);
}
sort(AB.begin(), AB.end());
fo... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,143 | 910,144 | u234365185 | cpp |
p03103 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define price first
#define drinks second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<ll, ll>
using namespace std;
const ... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lb long double
#define pb push_back
#define price first
#define drinks second
#define qwerty3 ->first
#define qwerty4 ->second
#define umap unordered_map
#define uset unordered_set
#define pii pair<ll, ll>
using namespace std;
const ... | [
"control_flow.loop.for.condition.change"
] | 910,145 | 910,146 | u916060970 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
vector<pair<long long, int>> c_info;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
c... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
vector<pair<long long, int>> c_info;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
c... | [
"identifier.change",
"call.arguments.change"
] | 910,154 | 910,155 | u557207741 | cpp |
p03103 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
ll n, m;
cin >> n >> m;
vector<pair<int, int>> vec(n);
rep(i, n) { cin >> vec[i].first... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> vec(n);
rep(i, n) { cin >> vec[i].first >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.change"
] | 910,163 | 910,161 | u168684371 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> lis;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (lis.count(a))
lis[a] += b;
else
lis[a] = b;
}
long long ans = 0;
int count = 0;
for (auto l : lis) {
auto k =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<long long, int> lis;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
if (lis.count(a))
lis[a] += b;
else
lis[a] = b;
}
long long ans = 0;
int count = 0;
for (auto l : lis) {
au... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,174 | 910,175 | u732578115 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> P(N);
rep(i, N) { cin >> P.at(i).first >> P.at(i).second; }
sort(P.begin(), P.end());
ll cnt = 0, m = 0;
while (cnt < M) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long int ll;
int main() {
ll N, M;
cin >> N >> M;
vector<pair<ll, ll>> P(N);
rep(i, N) { cin >> P.at(i).first >> P.at(i).second; }
sort(P.begin(), P.end());
ll cnt = 0, m = 0;
while (cnt < M) {
re... | [
"variable_declaration.type.change"
] | 910,189 | 910,190 | u089241640 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
int main(int argc, char *argv[]) {
int n, m;
std::cin >> n >> m;
std::vector<std::pair<int, int>> s(n);
for (int i = 0; i < n; ++i)
std::cin >> s.at(i).first >> s.at(i).second;
std::stable_sort(s.begin(), s.end());
int sum ... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
int main(int argc, char *argv[]) {
long n, m;
std::cin >> n >> m;
std::vector<std::pair<long, int>> s(n);
for (int i = 0; i < n; ++i)
std::cin >> s.at(i).first >> s.at(i).second;
std::stable_sort(s.begin(), s.end());
long s... | [
"variable_declaration.type.primitive.change"
] | 910,204 | 910,203 | u089888152 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
long long int a, b;
cin >> n >> m;
std::map<long long int, long long int> map;
for (int i = 0; i < n; i++) {
cin >> a >> b;
map.emplace(a, b);
}
long long int sum = 0;
for (auto itr = map.begin(); itr != map.end(); itr++) {... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
long long int a, b;
cin >> n >> m;
std::multimap<long long int, long long int> map;
for (int i = 0; i < n; i++) {
cin >> a >> b;
map.emplace(a, b);
}
long long int sum = 0;
for (auto itr = map.begin(); itr != map.end(); itr... | [] | 910,224 | 910,225 | u485821416 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
long long int a, b;
cin >> n >> m;
std::map<long long int, long long int> map;
for (int i = 0; i < n; i++) {
cin >> a >> b;
map.emplace(a, b);
}
long long int sum = 0;
for (auto itr = map.begin(); itr != map.end(); itr++) {... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
long long int a, b;
cin >> n >> m;
std::multimap<long long int, long long int> map;
for (int i = 0; i < n; i++) {
cin >> a >> b;
map.emplace(a, b);
}
long long int sum = 0;
for (auto itr = map.begin(); itr != map.end(); itr... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,226 | 910,225 | u485821416 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i++)
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<tuple<int, int>> memo;
rep(i, n) {
int a,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i > 0; i++)
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<tuple<ll, ll>> memo;
rep(i, n) {
ll a, b;
... | [
"variable_declaration.type.change"
] | 910,229 | 910,230 | u297398560 | cpp |
p03103 | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | #pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void) { return; }
template <typename First, typename... Rest>
void ci(First &first, Rest &...rest) {
cin >> first;
ci(rest...);
return;
}
inline void co(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest> void ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 910,235 | 910,236 | u449573758 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define repp(i, l, r, k) for (ll i = (l); i < (r); i += (k))
int main() {
int n, m;
ll ans = 0;
cin >> n >> m;
vector<pair<int, int>> vc(n);
rep(i, 0, n) cin >> vc[i].first >> vc[i].second;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
#define repp(i, l, r, k) for (ll i = (l); i < (r); i += (k))
int main() {
ll n, m;
ll ans = 0;
cin >> n >> m;
vector<pair<ll, ll>> vc(n);
rep(i, 0, n) cin >> vc[i].first >> vc[i].second;
so... | [
"variable_declaration.type.change"
] | 910,240 | 910,241 | u200060866 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define pii pair<int, int>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
int inf = 1000001000;
ll INF = 100000000000000000;
ll MOD =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (ll i = 1; i <= (n); ++i)
#define pll pair<ll, ll>
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
int inf = 1000001000;
ll INF = 100000000000000000;
ll MOD = 1... | [
"identifier.change",
"preprocessor.define.value.change",
"control_flow.branch.if.condition.change"
] | 910,244 | 910,243 | u510383220 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pp pair<int, int>
// int 2×10の9乗
int main() {
int n, m;
cin >> n >> m;
vector<pp> a(n);
rep(i, n) cin >> a[i].first >> a[i].second;
sort(a.begin(), a.end());
ll ans = 0;
rep(i, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define pp pair<int, int>
// int 2×10の9乗
int main() {
int n, m;
cin >> n >> m;
vector<pair<long, long>> a(n);
rep(i, n) cin >> a[i].first >> a[i].second;
sort(a.begin(), a.end());
ll ans ... | [] | 910,245 | 910,246 | u510383220 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<P> ab;
rep(i, n) {
int a, b;
cin >> a >> b;
ab.push_back(make_pair(a, b));
}
sort(ab... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<P> ab;
rep(i, n) {
int a, b;
cin >> a >> b;
ab.push_back(make_pair(a, b));
}
sort(ab... | [
"type_conversion.add"
] | 910,250 | 910,251 | u068713120 | cpp |
p03103 | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
ll sum = 0;
int count = 0;
cin >> N >> M;
vector<pair<int, int>> data(N);
rep(i, N) { cin >> data[i].first >> data[i].second; }
sort(data.begin()... | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
ll sum = 0;
int count = 0;
cin >> N >> M;
vector<pair<ll, int>> data(N);
rep(i, N) { cin >> data[i].first >> data[i].second; }
sort(data.begin(),... | [] | 910,252 | 910,253 | u138273120 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll, ll... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, s, n) for (int i = s; i < n; ++i)
#define all(a) a.begin(), a.end()
#define tmax(a, b, c) max(a, max(b, c))
#define tmin(a, b, c) min(a, min(b, c))
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll, ll... | [
"assignment.value.change",
"identifier.change",
"assignment.change"
] | 910,254 | 910,255 | u853721692 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(M);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i... | [] | 910,262 | 910,263 | u274195948 | cpp |
p03103 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL... | [
"assignment.value.change"
] | 910,264 | 910,265 | u863537799 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pairs(n);
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
pairs.at(i) = make_pair(a, b);
}
sort(pairs.begin(), pairs.end());
long long int ans = 0;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<long long int, long long int>> pairs(n);
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
pairs.at(i) = make_pair(a, b);
}
sort(pairs.begin(), pairs.end());
long long int ans = 0;
for (int i ... | [
"variable_declaration.type.widen.change"
] | 910,266 | 910,267 | u459105164 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> vec(n, vector<int>(2));
for (int i = 0; i < n; i++) {
cin >> vec.at(i).at(0) >> vec.at(i).at(1);
}
sort(vec.begin(), vec.end());
long long int ans = 0;
for (int i = 0; i < n; i++) {
if (m > ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<long long int>> vec(n, vector<long long int>(2));
for (int i = 0; i < n; i++) {
cin >> vec.at(i).at(0) >> vec.at(i).at(1);
}
sort(vec.begin(), vec.end());
long long int ans = 0;
for (int i = 0; i < n; i... | [
"variable_declaration.type.widen.change"
] | 910,268 | 910,269 | u459105164 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M, S = 0, i;
cin >> N >> M;
vector<pair<int, int>> X(N);
for (i = 0; i < N; i++)
cin >> X.at(i).first >> X.at(i).second;
sort(X.begin(), X.end());
i = 0;
while (M > 0) {
S += X.at(i).first * min(M, X.at(i).second);
M -= X.at(i).... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M, S = 0, i;
cin >> N >> M;
vector<pair<long long int, long long int>> X(N);
for (i = 0; i < N; i++)
cin >> X.at(i).first >> X.at(i).second;
sort(X.begin(), X.end());
i = 0;
while (M > 0) {
S += X.at(i).first * min(M, X.at... | [
"variable_declaration.type.widen.change"
] | 910,272 | 910,273 | u820224016 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(N), B(N);
vector<pair<ll, ll>> p;
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
p.push_back(make_pair(A[i], B[i]));
}
ll count = 0;
ll cost = 0;
sort(p.begin(), p.end())... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(N), B(N);
vector<pair<ll, ll>> p;
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
p.push_back(make_pair(A[i], B[i]));
}
ll count = 0;
ll cost = 0;
sort(p.begin(), p.end())... | [
"assignment.value.change"
] | 910,279 | 910,280 | u241312295 | cpp |
p03103 | #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... ... | [
"assignment.value.change"
] | 910,281 | 910,282 | u089177147 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
const int inf = 1e9;
int n, m, a[N], k, q, u, v, x, y, tc, c, l, r, ans, cnt, root[N], sz[N];
char s[N];
pai... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
const int inf = 1e9;
int n, m, a[N], k, q, u, v, x, y, tc, c, l, r, ans, cnt, root[N], sz[N];
char s[N];
pai... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 910,283 | 910,284 | u318875010 | cpp |
p03103 | #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... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 910,287 | 910,288 | u978260507 | cpp |
p03103 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> a;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
a.push_back(pair<int, int>(A, B));
}
sort(a.begin(), a.end());
long ans = 0;
for (int i = 0; i < N; i++) {... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<long, long>> a;
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
a.push_back(pair<int, int>(A, B));
}
sort(a.begin(), a.end());
long ans = 0;
for (int i = 0; i < N; i++)... | [
"variable_declaration.type.primitive.change"
] | 910,291 | 910,292 | u387371565 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
vector<pair<long long int, long long int>> X(N);
for (long long int i = 0; i < N; i++) {
long long int A, B;
cin >> A >> B;
X.at(i) = make_pair(A, B);
}
sort(X.begin(), X.end());
long long int ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
vector<pair<long long int, long long int>> X(N);
for (long long int i = 0; i < N; i++) {
long long int A, B;
cin >> A >> B;
X.at(i) = make_pair(A, B);
}
sort(X.begin(), X.end());
long long int ans ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 910,293 | 910,294 | u817769480 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
pair<long, int> ab[n];
for (int i = 0; i < n; i++)
cin >> ab[i].first >> ab[i].second;
sort(ab, ab + n);
int res = 0;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
pair<long, int> ab[n];
for (int i = 0; i < n; i++)
cin >> ab[i].first >> ab[i].second;
sort(ab, ab + n);
long res = 0;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 910,295 | 910,296 | u366398972 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
pair<int, int> ab[n];
for (int i = 0; i < n; i++)
cin >> ab[i].first >> ab[i].second;
sort(ab, ab + n);
int res = 0;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stack>
#include <string>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
pair<long, int> ab[n];
for (int i = 0; i < n; i++)
cin >> ab[i].first >> ab[i].second;
sort(ab, ab + n);
long res = 0;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 910,297 | 910,296 | u366398972 | cpp |
p03103 | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
typedef long long int ll;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> A(N);
rep(i, N) {
int a, b;
cin >> a >> b;
A.... | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
typedef long long int ll;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> A(N);
rep(i, N) {
int a, b;
cin >> a >> b;
A.... | [
"type_conversion.add"
] | 910,300 | 910,301 | u276980836 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> p(n);
rep(i, n) { cin >> p.at(i).first >> p.at(i).second; }
sort(p.begin(), p.end());
long long sum = 0;
rep(i, n) {
if (m >= p.at(i).secon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
long long n, m;
cin >> n >> m;
vector<pair<long long, long long>> p(n);
rep(i, n) { cin >> p.at(i).first >> p.at(i).second; }
sort(p.begin(), p.end());
long long sum = 0;
rep(i, n) {
if (... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,315 | 910,316 | u690475097 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int long long ans = 0;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
v.push_back(make_pa... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
int long long ans = 0;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
int long long x, y;
cin >> x >> y;
v.push_ba... | [
"variable_declaration.add"
] | 910,319 | 910,320 | u260907804 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; i++)
cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < n; i++) {
int amount = min(q, v[i].second);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, q;
cin >> n >> q;
vector<pair<ll, ll>> v(n);
for (int i = 0; i < n; i++)
cin >> v[i].first >> v[i].second;
sort(v.begin(), v.end());
ll ans = 0;
for (int i = 0; i < n; i++) {
int amount = min(q, v[i].secon... | [] | 910,321 | 910,322 | u729337236 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
return 1;
}
return 0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
template <class Type> inline bool chmax(Type &a, Type b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> inline bool chmin(Type &a, Type b) {
if (a > b) {
a = b;
return 1;
}
return 0... | [] | 910,329 | 910,330 | u999989620 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.