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 |
|---|---|---|---|---|---|---|---|
p03103 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <utility>
#include <vector>
using namespace std;
bool sortit(pair<int, int> a, pair<int, int> b) { return (a.first < b.first); }
int main() {
int n, m;
cin >> n >> m;
// insertion into two arrays
int arr1[n], arr2[n];
vector<pair<int, int>... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <utility>
#include <vector>
using namespace std;
bool sortit(pair<long int, long int> a, pair<long int, long int> b) {
return (a.first < b.first);
}
int main() {
int n, m;
cin >> n >> m;
// insertion into two arrays
long int arr1[n], arr2[... | [
"variable_declaration.type.widen.change"
] | 910,333 | 910,334 | u551519692 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <utility>
#include <vector>
using namespace std;
bool sortit(pair<int, int> a, pair<int, int> b) { return (a.first < b.first); }
int main() {
int n, m;
cin >> n >> m;
// insertion into two arrays
int arr1[n], arr2[n];
vector<pair<int, int>... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <utility>
#include <vector>
using namespace std;
bool sortit(pair<int, int> a, pair<int, int> b) { return (a.first < b.first); }
int main() {
int n, m;
cin >> n >> m;
// insertion into two arrays
long int arr1[n], arr2[n];
vector<pair<long... | [
"variable_declaration.type.widen.change"
] | 910,333 | 910,335 | u551519692 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <utility>
#include <vector>
using namespace std;
bool sortit(pair<int, int> a, pair<int, int> b) { return (a.first < b.first); }
int main() {
int n, m;
cin >> n >> m;
// insertion into two arrays
int arr1[n], arr2[n];
vector<pair<int, int>... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <utility>
#include <vector>
using namespace std;
bool sortit(pair<int, int> a, pair<int, int> b) { return (a.first < b.first); }
int main() {
int n, m;
cin >> n >> m;
// insertion into two arrays
long int arr1[n], arr2[n];
vector<pair<long... | [
"variable_declaration.type.widen.change"
] | 910,336 | 910,335 | u551519692 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <utility>
#include <vector>
using namespace std;
bool sortit(pair<int, int> a, pair<int, int> b) { return (a.first < b.first); }
int main() {
int n, m;
cin >> n >> m;
// insertion into two arrays
int arr1[n], arr2[n];
vector<pair<int, int>... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <utility>
#include <vector>
using namespace std;
bool sortit(pair<int, int> a, pair<int, int> b) { return (a.first < b.first); }
int main() {
int n, m;
cin >> n >> m;
// insertion into two arrays
long int arr1[n], arr2[n];
vector<pair<long... | [
"variable_declaration.type.widen.change"
] | 910,337 | 910,335 | u551519692 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> A(N);
vector<long long> B(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
vector<pair<long long, long long>> p(N);
for (long long i = 0; i < N; i++) {
p.at(i) = make... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> A(N);
vector<long long> B(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
vector<pair<long long, long long>> p(N);
for (long long i = 0; i < N; i++) {
p.at(i) = make... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,338 | 910,339 | u681084651 | cpp |
p03103 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> prices(n);
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
prices[i] = make_pair(a, b);
}
sort(prices.begin(), prices.end());
int ans = 0;
for (int i = 0... | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> prices(n);
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
prices[i] = make_pair(a, b);
}
sort(prices.begin(), prices.end());
ll ans = 0;
for (int i = 0;... | [
"variable_declaration.type.change"
] | 910,357 | 910,358 | u616461826 | cpp |
p03103 | using namespace std;
#include <bits/stdc++.h>
int main() {
long long N, M;
cin >> N >> M;
vector<pair<long long, long long>> A(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i).first >> A.at(i).second;
}
sort(A.begin(), A.end());
long long price = 0; //かかった金額
long long Juice = 0; //買った本数
... | using namespace std;
#include <bits/stdc++.h>
int main() {
long long N, M;
cin >> N >> M;
vector<pair<long long, long long>> A(N);
for (long long i = 0; i < N; i++) {
cin >> A.at(i).first >> A.at(i).second;
}
sort(A.begin(), A.end());
long long price = 0; //かかった金額
long long Juice = 0; //買った本数
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 910,359 | 910,360 | u615258936 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
map<long long, long long> AB;
for (long long i = 0; i < N; ++i) {
long long a, b;
cin >> a >> b;
AB.insert(make_pair(a, b));
}
long long ... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
multimap<long long, long long> AB;
for (long long i = 0; i < N; ++i) {
long long a, b;
cin >> a >> b;
AB.insert(make_pair(a, b));
}
long ... | [
"variable_declaration.type.change"
] | 910,372 | 910,373 | u774160580 | cpp |
p03103 | #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 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pa... | #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 1000000000
#define MOD MM + 7
#define MAX 101000
#define MAP 110
#define initial_value -1
#define Pair pa... | [
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 910,383 | 910,384 | u342051078 | cpp |
p03103 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i != -1; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i != -1; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define... | [
"variable_declaration.type.change"
] | 910,389 | 910,390 | u431929942 | cpp |
p03103 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#inc... | [
"control_flow.break.add"
] | 910,403 | 910,404 | u313994303 | cpp |
p03103 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 3e18 + 7
#define MOD 1000000007
using names... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 3e18 + 7
#define MOD 1000000007
using names... | [
"variable_declaration.type.change"
] | 910,412 | 910,413 | u493750228 | cpp |
p03103 | #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, M;
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() {
ll N, M;
cin >> N >... | [
"variable_declaration.type.change"
] | 910,414 | 910,415 | u822169805 | cpp |
p03103 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vu;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vu;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef... | [
"assignment.change"
] | 910,422 | 910,423 | u519883882 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Out(S) cout << S << endl
#define Vecpr vector<pair<int, int>>
int main() {
lli A, B, C, D = 0;
cin >... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb(n) push_back(n)
#define Sort(n) sort(n.begin(), n.end())
#define Out(S) cout << S << endl
#define Vecpr vector<pair<lli, lli>>
int main() {
lli A, B, C, D = 0;
cin >... | [
"preprocessor.define.value.change"
] | 910,430 | 910,431 | u618604643 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n, m;
long long int a, b;
vector<pair<long long int, long long int>> s;
int res = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
s.push_back(make_pair(a, b))... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n, m;
long long int a, b;
vector<pair<long long int, long long int>> s;
long long int res = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
s.push_back(make_p... | [
"variable_declaration.type.widen.change"
] | 910,432 | 910,433 | u365058393 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n, m;
long long int a, b;
vector<pair<long long int, long long int>> s;
int res = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
s.push_back(make_pair(a, b))... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n, m;
long long int a, b;
vector<pair<long long int, long long int>> s;
long long int res = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
s.push_back(make_p... | [
"variable_declaration.type.widen.change"
] | 910,434 | 910,433 | u365058393 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int $(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
signed main() {
int a, b, d = 0;
cin >> a >> b;
vector<pair<int, int>> c(a);
for (int i = 0; i < a; i++)
cin >> c.at(i).first >> c.at(i).second;
sor... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int $(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
signed main() {
int a, b, d = 0;
cin >> a >> b;
vector<pair<int, int>> c(a);
for (int i = 0; i < a; i++)
cin >> c.at(i).first >> c.at(i).second;
sor... | [
"control_flow.break.add"
] | 910,435 | 910,436 | u322177979 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
const int max_n = 1e5 + 10;
using pq = pair<int, int>;
int main() {
int n, m;
priority_queue<pq, vector<pq>, greater<pq>> que;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
que.push(make_pair(a, b));
}
long long res = 0;
... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 1e5 + 10;
using pq = pair<long, long>;
int main() {
int n, m;
priority_queue<pq, vector<pq>, greater<pq>> que;
cin >> n >> m;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
que.push(make_pair(a, b));
}
long long res = 0;
... | [
"variable_declaration.type.primitive.change"
] | 910,440 | 910,441 | u835629653 | cpp |
p03103 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define swap(a, b) ... | [
"variable_declaration.type.change"
] | 910,449 | 910,450 | u040251933 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n, m;
cin >> n >> m;
vector<P> ab(n);
REP(i, n)
cin >> ab[i].firs... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<int> VI;
const ll MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
int main() {
int n, m;
cin >> n >> m;
vector<P> ab(n);
REP(i, n)
cin >> ab[i].firs... | [
"variable_declaration.type.change"
] | 910,455 | 910,456 | u408650734 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
int m;
cin >> m;
vector<pair<long long int, int>> a(n);
for (int i = 0; i < n; i++) {
long long int c;
int b;
cin >> c >> b;
a[i] = {c, b};
}
sort(a.begin()... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int n;
cin >> n;
int m;
cin >> m;
vector<pair<long long int, int>> a(n);
for (int i = 0; i < n; i++) {
long long int c;
int b;
cin >> c >> b;
a[i] = {c, b};
}
sort(a.begin()... | [
"variable_declaration.type.widen.change"
] | 910,464 | 910,465 | u264405855 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll n, m;
int main(void) {
cin >> n >> m;
vector<pair<ll, ll>> ab;
rep(i, n) {
ll tmpa, tmpb;
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll n, m;
int main(void) {
cin >> n >> m;
vector<pair<ll, ll>> ab;
rep(i, n) {
ll tmpa, tmpb;
c... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 910,475 | 910,476 | u076566148 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#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 speed \
ios_base::sync_with_stdio... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#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 speed \
ios_base::sync_with_stdio... | [
"variable_declaration.type.change"
] | 910,482 | 910,483 | u843739531 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<pair<ll, ll>> S(N);
for (int i = 0; i < N; ++i) {
ll a, b;
cin >> a >> b;
S[i].first = a;
S[i].second = b;
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<pair<ll, ll>> S(N);
for (int i = 0; i < N; ++i) {
ll a, b;
cin >> a >> b;
S[i].first = a;
S[i].second = b;
}
... | [] | 910,484 | 910,485 | u577747009 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
vector<pair<int, int>> a(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
for (int i = 0; i < N; i++) {
a.at(i) = {A.at(i), B.at(i)};
}
sort(a.begin(), a.end());
int... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
vector<pair<long int, long int>> a(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i) >> B.at(i);
}
for (int i = 0; i < N; i++) {
a.at(i) = {A.at(i), B.at(i)};
}
sort(a.begin(), a.end... | [
"variable_declaration.type.widen.change"
] | 910,486 | 910,487 | u157677852 | cpp |
p03103 | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
struct S_info {
int a, b;
};
int compare(const void *pEle1, const void *pEle2) {
const S_info *pmem1 = (const S_info *)pEle1;
const S_info *pmem2 = (const S_info *)pEle2;
return (pmem1->a - pmem2->a);
}
int main... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
struct S_info {
long long int a, b;
};
int compare(const void *pEle1, const void *pEle2) {
const S_info *pmem1 = (const S_info *)pEle1;
const S_info *pmem2 = (const S_info *)pEle2;
return (pmem1->a - pmem2->a);
}... | [
"variable_declaration.type.widen.change"
] | 910,488 | 910,489 | u417660734 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
vector<pair<int, int>> drink(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
drink[i] = make_pair(a, b);
}
sort(drink.begin(), drink.end());
int k = 0;
while (m > 0) {
ans ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, m;
cin >> n >> m;
long long ans = 0;
vector<pair<long, long>> drink(n);
for (int i = 0; i < n; i++) {
long a, b;
cin >> a >> b;
drink[i] = make_pair(a, b);
}
sort(drink.begin(), drink.end());
int k = 0;
while (m > 0) {
... | [
"variable_declaration.type.primitive.change"
] | 910,496 | 910,497 | u885523920 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long ans = 0;
vector<pair<int, int>> drink(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
drink[i] = make_pair(a, b);
}
sort(drink.begin(), drink.end());
int k = 0;
while (m > 0) {
ans += (d... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, m;
cin >> n >> m;
long long ans = 0;
vector<pair<long, long>> drink(n);
for (int i = 0; i < n; i++) {
long a, b;
cin >> a >> b;
drink[i] = make_pair(a, b);
}
sort(drink.begin(), drink.end());
int k = 0;
while (m > 0) {
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,498 | 910,497 | u885523920 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<long long, long long>> shop;
int n, m;
cin >> n >> m;
int num = 0;
long long sum = 0;
for (auto i = 0; i < n; i++) {
pair<long long, long long> p;
long long a, b;
cin >> a >> b;
p.first = a;
p.second = b;
shop.p... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<long long, long long>> shop;
int n, m;
cin >> n >> m;
int num = 0;
long long sum = 0;
for (auto i = 0; i < n; i++) {
pair<long long, long long> p;
long long a, b;
cin >> a >> b;
p.first = a;
p.second = b;
shop.p... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 910,499 | 910,500 | u679245300 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
vector<pair<long long int, long long int>> ab;
cin >> n >> m;
for (int i = 0; i < n; i++) {
long long int a, b;
cin >> a >> b;
ab.push_back(make_pair(a, b));
}
sort(ab.begin(), ab.end());
l... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
vector<pair<long long int, long long int>> ab;
cin >> n >> m;
for (int i = 0; i < n; i++) {
long long int a, b;
cin >> a >> b;
ab.push_back(make_pair(a, b));
}
sort(ab.begin(), ab.end());
l... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,501 | 910,502 | u115819033 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<pair<ll, ll>> AB(N);
for (int i = 0; i < N; i++) {
cin >> AB[i].first >> AB[i].second;
}
sort(AB.begin(), AB.end());
ll sum = 0;
ll cnt = 0;
int i =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, M;
cin >> N >> M;
vector<pair<ll, ll>> AB(N);
for (int i = 0; i < N; i++) {
cin >> AB[i].first >> AB[i].second;
}
sort(AB.begin(), AB.end());
ll sum = 0;
ll cnt = 0;
int i =... | [
"expression.operation.binary.remove",
"assignment.change"
] | 910,509 | 910,510 | u904123392 | cpp |
p03103 | #include <algorithm>
#include <bits/stdc++.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 j = 0; j < N; j++) {
AB[j] = make_pa... | #include <algorithm>
#include <bits/stdc++.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 j = 0; j < N; j++) {
AB[j] = make_pa... | [
"variable_declaration.value.change"
] | 910,511 | 910,512 | u904123392 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i].first >> A[i].second;
}
sort(A.begin(), A.end());
int sum = 0;
long mon = 0;
int i = 0;
while (sum < M) {
sum += A[i].second;
mon +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
vector<pair<long, long>> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i].first >> A[i].second;
}
sort(A.begin(), A.end());
long sum = 0;
long mon = 0;
int i = 0;
while (sum < M) {
sum += A[i].second;
mo... | [
"variable_declaration.type.primitive.change"
] | 910,513 | 910,514 | u593555034 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i;
long long ans = 0;
cin >> n >> m;
vector<pair<int, int>> ab(n);
for (i = 0; i < n; i++) {
cin >> ab[i].first >> ab[i].second;
}
sort(ab.begin(), ab.end());
for (i = 0; i < n; i++) {
if (ab[i].second < m) {
ans += a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i;
long long ans = 0;
cin >> n >> m;
vector<pair<long, long>> ab(n);
for (i = 0; i < n; i++) {
cin >> ab[i].first >> ab[i].second;
}
sort(ab.begin(), ab.end());
for (i = 0; i < n; i++) {
if (ab[i].second < m) {
ans +=... | [
"variable_declaration.type.primitive.change"
] | 910,521 | 910,522 | u493122449 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> D(N);
for (int i = 0; i < N; i++) {
pair<int, int> P;
cin >> P.first >> P.second;
D[i] = P;
}
sort(D.begin(), D.end());
long long res... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<long, int>> D(N);
for (int i = 0; i < N; i++) {
pair<long, int> P;
cin >> P.first >> P.second;
D[i] = P;
}
sort(D.begin(), D.end());
long long r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,523 | 910,524 | u813102292 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<std::pair<int, int>> shops;
for (int i = 0; i < n; i++) {
int a, b;
std::cin >> a >> b;
shops.push_back(std::pair<int, int>(a, b));
}
std::sort(shops.begin(), s... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<std::pair<int, int>> shops;
for (int i = 0; i < n; i++) {
int a, b;
std::cin >> a >> b;
shops.push_back(std::pair<int, int>(a, b));
}
std::sort(shops.begin(), s... | [
"variable_declaration.type.narrow.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,525 | 910,526 | u775347320 | cpp |
p03103 | #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 ALL(x) x.begin(), x.end()
#define REVERSE(x) reverse(x.begin(), x.end())
#define P pair<int, int>
typedef long long LL;
c... | #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 ALL(x) x.begin(), x.end()
#define REVERSE(x) reverse(x.begin(), x.end())
#define P pair<int, int>
typedef long long LL;
c... | [] | 910,531 | 910,532 | u709810602 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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 sum = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
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 sum = 0;... | [] | 910,551 | 910,552 | u488963488 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <iterator>
#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] = make_pair(A[... | #include <algorithm>
#include <iostream>
#include <iterator>
#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] = make_pair(A[... | [
"assignment.add"
] | 910,553 | 910,554 | u130834452 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
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());
for (i... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long ans = 0;
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());
for (i... | [
"type_conversion.add"
] | 910,557 | 910,558 | u401900157 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 28;
vector<pair<int, int>> p;
long long ans;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
p.push_back({a, b});
}
sort(p.begin(), p.end());
int c = 0;
int i = 0;
while (c + p[i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 28;
vector<pair<int, int>> p;
long long ans;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
p.push_back({a, b});
}
sort(p.begin(), p.end());
int c = 0;
int i = 0;
while (c + p[i... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 910,561 | 910,562 | u362769442 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Fastest \
ios_base ::sync_with_stdio(false); \
cin.tie(NULL); \
cout.t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Fastest \
ios_base ::sync_with_stdio(false); \
cin.tie(NULL); \
cout.t... | [
"assignment.change"
] | 910,563 | 910,564 | u720795206 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m, left;
long long ans;
cin >> n >> m;
vector<pair<int, int>> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i].first >> vec[i].second;
}
sort(vec.begin(), vec.end());
left = m... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m, left;
long long ans;
cin >> n >> m;
vector<pair<int, int>> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i].first >> vec[i].second;
}
sort(vec.begin(), vec.end());
left = m... | [
"type_conversion.add"
] | 910,565 | 910,566 | u749475370 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
int tmp1, tmp2;
cin >> tmp1 >> tmp2;
A[i].first = tmp1;
A[i].second = tmp2;
}
// for (int i = 0; i < N; i++)
//{
// cout << i << "th" << A[i].... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
int tmp1, tmp2;
cin >> tmp1 >> tmp2;
A[i].first = tmp1;
A[i].second = tmp2;
}
// for (int i = 0; i < N; i++)
//{
// cout << i << "th" << A[i].... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 910,567 | 910,568 | u934246119 | cpp |
p03103 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> data_t;
int main() {
vector<data_t> a(114514);
int n, m, res = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
int j = ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef pair<long long, int> data_t;
int main() {
vector<data_t> a(114514);
long long n, m, res = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,572 | 910,573 | u266479350 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
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] = make_pair(A[i], B[i]);
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
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] = make_pair(A[i], B[i]);
... | [
"type_conversion.add"
] | 910,574 | 910,575 | u791220701 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i;
cin >> n >> m;
vector<pair<int, int>> li(n);
for (i = 0; i < n; i++) {
cin >> li[i].first >> li[i].second;
}
sort(li.begin(), li.end());
long long int ans = 0, mazai = 0;
for (i = 0; mazai < m; i++) {
ans += li[i].first * l... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i;
cin >> n >> m;
vector<pair<long long int, long long int>> li(n);
for (i = 0; i < n; i++) {
cin >> li[i].first >> li[i].second;
}
sort(li.begin(), li.end());
long long int ans = 0, mazai = 0;
for (i = 0; mazai < m; i++) {
an... | [
"variable_declaration.type.widen.change"
] | 910,576 | 910,577 | u676496404 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i;
cin >> n >> m;
vector<pair<int, int>> li(n);
for (i = 0; i < n; i++) {
cin >> li[i].first >> li[i].second;
}
sort(li.begin(), li.end());
int ans = 0, mazai = 0;
for (i = 0; mazai < m; i++) {
ans += li[i].first * li[i].secon... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i;
cin >> n >> m;
vector<pair<long long int, long long int>> li(n);
for (i = 0; i < n; i++) {
cin >> li[i].first >> li[i].second;
}
sort(li.begin(), li.end());
long long int ans = 0, mazai = 0;
for (i = 0; mazai < m; i++) {
an... | [
"variable_declaration.type.widen.change"
] | 910,578 | 910,577 | u676496404 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n, m;
struct elm {
int a, b;
} a[N];
bool operator<(const elm &l, const elm &r) {
return l.a < r.a || (l.a == r.a && l.b > r.b);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d%d", &a[i].a, &a[i].b);
t... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n, m;
struct elm {
int a, b;
} a[N];
bool operator<(const elm &l, const elm &r) {
return l.a < r.a || (l.a == r.a && l.b > r.b);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d%d", &a[i].a, &a[i].b);
t... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 910,581 | 910,582 | u286309545 | 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];
cin >> 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.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];
cin >> 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.beg... | [
"type_conversion.add"
] | 910,589 | 910,590 | u307834890 | 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];
cin >> 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.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];
cin >> 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.beg... | [
"assignment.change"
] | 910,591 | 910,590 | u307834890 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> c(n);
for (int i = 0; i < n; i++) {
cin >> c[i].first >> c[i].second;
}
sort(c.begin(), c.end());
int number = m;
int cost = 0;
for (int i = 0; i < n; i++) {
if (number - c[i].second >=... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<pair<long, long>> c(n);
for (int i = 0; i < n; i++) {
cin >> c[i].first >> c[i].second;
}
sort(c.begin(), c.end());
long number = m;
long cost = 0;
for (int i = 0; i < n; i++) {
if (number - c[i]... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,596 | 910,597 | u882039496 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int a, b;
vector<pair<int, int>> p(N);
for (int i = 0; i < N; i++) {
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p.begin(), p.end());
int sum = 0;
for (int i = 0; i < N && M > 0; i++) {
if (p[i].second ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int a, b;
vector<pair<long, int>> p(N);
for (int i = 0; i < N; i++) {
cin >> a >> b;
p[i] = make_pair(a, b);
}
sort(p.begin(), p.end());
long sum = 0;
for (int i = 0; i < N && M > 0; i++) {
if (p[i].secon... | [
"variable_declaration.type.primitive.change"
] | 910,598 | 910,599 | u423656246 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<pair<ll, ll>> a(N);
rep(i, N) { cin >> a[i].first >> a[i].second; }
sort(a.begin(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<pair<ll, ll>> a(N);
rep(i, N) { cin >> a[i].first >> a[i].second; }
sort(a.begin(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,609 | 910,610 | u979078704 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> a(N);
rep(i, N) { cin >> a[i].first >> a[i].second; }
sort(a.begi... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<pair<ll, ll>> a(N);
rep(i, N) { cin >> a[i].first >> a[i].second; }
sort(a.begin(... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,611 | 910,610 | u979078704 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
struct node {
long long int p, q;
};
bool comp(struct node x, struct node y) {
if (x.p < y.p)
return true;
else
return false;
}
int main()
{
long long int a, b, c, d, i, j, k, l;
cin >> a >> b;
struct node n[a];
for (i = 0; i < a; i++) {
cin >>... | #include <bits/stdc++.h>
using namespace std;
struct node {
long long int p, q;
};
bool comp(struct node x, struct node y) {
if (x.p < y.p)
return true;
else
return false;
}
int main()
{
long long int a, b, c, d, i, j, k, l;
cin >> a >> b;
struct node n[a];
for (i = 0; i < a; i++) {
cin >>... | [
"variable_declaration.type.widen.change"
] | 910,612 | 910,613 | u858841329 | cpp |
p03103 | #include <algorithm>
#include <functional>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
pair<int, int> a[110000];
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a, a + n);
int ans = 0;
int dai = 0;
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
pair<long int, long int> a[110000];
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a, a + n);
long int ans = 0;
... | [
"variable_declaration.type.widen.change"
] | 910,621 | 910,622 | u740363301 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | [
"variable_declaration.type.change"
] | 910,625 | 910,626 | u127768253 | cpp |
p03103 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
const ll LL_MAX(1LL << 60);
#define rep(i, s, e) for (ll i = (s); i < (e); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
const ll LL_MAX(1LL << 60);
#define rep(i, s, e) for (ll i = (s); i < (e); i++)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m... | [
"variable_declaration.type.change"
] | 910,630 | 910,631 | u778668639 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i_length = (n); i < i_length; i++)
#define MOD 1000000007
#define ll long long
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> a;
rep(i, n) {
ll x, y;
cin >> x >> y;
a.push_back(make_pair(x, y));
}
sort... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i_length = (n); i < i_length; i++)
#define MOD 1000000007
#define ll long long
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> a;
rep(i, n) {
ll x, y;
cin >> x >> y;
a.push_back(make_pair(x, y));
}
sor... | [
"control_flow.branch.if.condition.change"
] | 910,648 | 910,649 | u321761416 | 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, n) for (int i = (a); i < (n); i++)
#define repb(i, n) for (int i = (n - 1); i >= 0; i--)
#define repb2(i, a, n) for (int i = (n - 1); i >= (a); i--)
#define all(x) x.begin(), x.end()
#d... | #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, n) for (int i = (a); i < (n); i++)
#define repb(i, n) for (int i = (n - 1); i >= 0; i--)
#define repb2(i, a, n) for (int i = (n - 1); i >= (a); i--)
#define all(x) x.begin(), x.end()
#d... | [
"call.add"
] | 910,650 | 910,651 | u075520262 | cpp |
p03103 | #define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long llong;
struct Drink {
llong num;
llong price;
bool operator<(const Drink &another) const { return price < another.price; }
};
void solve() {
int N, M;
cin >> N >> M;
vector<Drink> drink(N);
rep... | #define rep(i, n) for (int i = 0; i < n; i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long llong;
struct Drink {
llong num;
llong price;
bool operator<(const Drink &another) { return num < another.num; }
};
void solve() {
int N, M;
cin >> N >> M;
vector<Drink> drink(N);
rep(i, N) sca... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 910,652 | 910,653 | u863957421 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int n, m;
cin >> n >> m;
ll ans = 0;
vector<pair<int, int>> a;
rep(i, n) {
int x, y;
cin >> x >> y;
a.emplace_back(x, y);
}
sort(a.begin(), a.end());
int ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(void) {
int n, m;
cin >> n >> m;
ll ans = 0;
vector<pair<ll, ll>> a;
rep(i, n) {
int x, y;
cin >> x >> y;
a.emplace_back(x, y);
}
sort(a.begin(), a.end());
int cnt = ... | [
"variable_declaration.type.narrow.change"
] | 910,658 | 910,659 | u905170328 | cpp |
p03103 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> mise(N);
int A, B;
for (int i = 0; i < N; i++) {
cin >> A >> B;
mise.at(i) = make_pair(A, B);
}
sort(mise.begin(), mise.end());
int ans = 0;
int honsu = M; // ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> mise(N);
int A, B;
for (int i = 0; i < N; i++) {
cin >> A >> B;
mise.at(i) = make_pair(A, B);
}
sort(mise.begin(), mise.end());
int ans = 0;
int honsu = M; // ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,660 | 910,661 | u521652313 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(n);
vector<pair<int, int>> ab(n);
rep(i, n) {
cin >> a.at(i) >> b.at(i);
ab.at(i) = make_pair(a.at(i), b.at(i));
}
sort(ab.begin(), ab.end());
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int64_t> a(n), b(n);
vector<pair<int64_t, int>> ab(n);
rep(i, n) {
cin >> a.at(i) >> b.at(i);
ab.at(i) = make_pair(a.at(i), b.at(i));
}
sort(ab.begin(), ab.en... | [
"variable_declaration.type.primitive.change"
] | 910,664 | 910,665 | u009870106 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
set<pair<ll, ll>> pq;
ll n, m;
cin >> n >> m;
for (ll i = 0; i < n; i++) {
ll coin, num;
scanf("%lld %lld", &coin, &num);
pq.insert({coin, -num});
}
ll cnt = 0;
ll koyta_nilam = 0;
for (auto tmp : pq) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
multimap<ll, ll> pq;
ll n, m;
cin >> n >> m;
for (ll i = 0; i < n; i++) {
ll coin, num;
scanf("%lld %lld", &coin, &num);
pq.insert({coin, -num});
}
ll cnt = 0;
ll koyta_nilam = 0;
for (auto tmp : pq) {
... | [
"variable_declaration.type.change"
] | 910,666 | 910,667 | u945133959 | cpp |
p03103 | #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 ll mod = 1000000007;
const ll mod2 = 998... | #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 ll mod = 1000000007;
const ll mod2 = 998... | [
"call.arguments.change"
] | 910,670 | 910,671 | u759721333 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pair(n);
for (int i = 0; i < n; i++) {
cin >> pair[i].first >> pair[i].second;
}
int ans = 0;
sort(pair.begin(), pair.end());
int j = 0;
while (m != 0) {
if (pair[j].second <= m) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<long, long>> pair(n);
for (int i = 0; i < n; i++) {
cin >> pair[i].first >> pair[i].second;
}
long long ans = 0;
sort(pair.begin(), pair.end());
int j = 0;
while (m != 0) {
if (pair[j].second <... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,672 | 910,673 | u964726243 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1000000007
int main() {
vector<pair<ll, ll>> a;
ll n, m, ans = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
ll x, z;
cin >> x >> z;
a.push_back(make_pair(x, z));
}
sort(a.begin(), a.end());
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1000000007
int main() {
vector<pair<ll, ll>> a;
ll n, m, ans = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
ll x, z;
cin >> x >> z;
a.push_back(make_pair(x, z));
}
sort(a.begin(), a.end());
for (int i = 0; i < ... | [
"control_flow.break.add"
] | 910,674 | 910,675 | u166378830 | cpp |
p03103 | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
#define lrep(i, n) for (long l... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define irep(i, n) for (int i = n - 1; i >= 0; i--)
#define lrep(i, n) for (long l... | [
"assignment.value.change"
] | 910,683 | 910,684 | u379440427 | cpp |
p03103 | #include <bits/stdc++.h>
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());
long long ans = 0;
for (int i = 0; i < N; i++) {
if (AB[i][1] < M) {
ans ... | #include <bits/stdc++.h>
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());
long long ans = 0;
for (int i = 0; i < N; i++) {
if (AB[i][1] < M) {
ans ... | [
"type_conversion.add"
] | 910,685 | 910,686 | u275786410 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <map>
#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] = make_pai... | #include <algorithm>
#include <iostream>
#include <map>
#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] = make_pai... | [] | 910,707 | 910,708 | u640827947 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long sum, a, N, M, m, b;
cin >> N >> M;
m = M;
sum = 0;
vector<pair<long long, long long>> ans(N);
for (int i = 0; i < N; i++) {
cin >> a >> b;
ans.push_back(make_pair(a, b));
}
sort(ans.begin(), ans.end());
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long sum, a, N, M, m, b;
cin >> N >> M;
m = M;
sum = 0;
vector<pair<long long, long long>> ans(N);
for (int i = 0; i < N; i++) {
cin >> a >> b;
ans[i] = make_pair(a, b);
}
sort(ans.begin(), ans.end());
for (int i = 0; i < M; i++... | [
"call.arguments.change"
] | 910,713 | 910,714 | u902787159 | cpp |
p03103 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define repR(i, n) for (ll i = n; i >= 0; ++i)
#define FDS(i, n) for (ll i = 0; i < n; ++i)
#define FDSR(i, n) for (ll i = n; i >= 0; ++i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define VSORT... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define repR(i, n) for (ll i = n; i >= 0; ++i)
#define FDS(i, n) for (ll i = 0; i < n; ++i)
#define FDSR(i, n) for (ll i = n; i >= 0; ++i)
#define FOR(i, m, n) for (ll i = m; i < n; ++i)
#define FORR(i, m, n) for (ll i = m; i >= n; --i)
#define VSORT... | [
"assignment.value.change"
] | 910,731 | 910,732 | u870797515 | cpp |
p03103 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define REP(i, n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define REP(i, n)... | [] | 910,733 | 910,737 | u784072785 | cpp |
p03103 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define REP(i, n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define REP(i, n)... | [
"variable_declaration.type.change"
] | 910,736 | 910,737 | u784072785 | cpp |
p03103 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define REP(i, n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define REP(i, n)... | [] | 910,733 | 910,738 | u784072785 | cpp |
p03103 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define REP(i, n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define REP(i, n)... | [
"variable_declaration.type.change"
] | 910,736 | 910,738 | u784072785 | cpp |
p03103 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define REP(i, n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define debug(x) cerr << #x << ':' << x << endl
#define REP(i, n)... | [
"literal.number.type.widen.change"
] | 910,733 | 910,739 | u784072785 | cpp |
p03103 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define RE... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define RE... | [
"variable_declaration.type.change"
] | 910,744 | 910,745 | u055303078 | cpp |
p03103 | #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() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> mz(n);
rep(i, n) {
int a, b;
cin >> a >> b;
mz[i] = make_pair(a,... | #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() {
int n, m;
cin >> n >> m;
vector<pair<ll, ll>> mz(n);
rep(i, n) {
ll a, b;
cin >> a >> b;
mz[i] = make_pair(a, b)... | [
"variable_declaration.type.change"
] | 910,748 | 910,749 | u491279738 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
vector<pair<ll, ll>> P;
// vectorをpairに入れてsortする
int main() {
ll n, m;
cin >> n >> m;
ll a, b;
int ans = 0;
for (i... | #include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
vector<pair<ll, ll>> P;
// vectorをpairに入れてsortする
int main() {
ll n, m;
cin >> n >> m;
ll a, b;
ll ans = 0;
for (in... | [
"variable_declaration.type.change"
] | 910,761 | 910,762 | u139300044 | cpp |
p03103 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int MAX_N = 110000;
int N, M;
int A[MAX_N], B[MAX_N];
pair<int, int> itv[MAX_N];
int main() {
cin >> N >> M;
for (int i = 0; i < N; ++i) {
cin >> A[i] >> B[i];
itv[i].first = A[i];
itv[i].second = B[i];
}
sort(itv, itv + N)... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int MAX_N = 110000;
int N, M;
int A[MAX_N], B[MAX_N];
pair<int, int> itv[MAX_N];
int main() {
cin >> N >> M;
for (int i = 0; i < N; ++i) {
cin >> A[i] >> B[i];
itv[i].first = A[i];
itv[i].second = B[i];
}
sort(itv, itv + N)... | [
"type_conversion.add"
] | 910,766 | 910,767 | u747390421 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> P(N);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
P[i].first = A;
P[i].second = B;
}
sort(P.begin(), P.end());
int mone... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long int N, M;
cin >> N >> M;
vector<pair<long int, long int>> P(N);
for (int i = 0; i < N; i++) {
long int A, B;
cin >> A >> B;
P[i].first = A;
P[i].second = B;
}
sort(P.begin(), P... | [
"variable_declaration.type.widen.change"
] | 910,770 | 910,771 | u969116807 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) ... | [
"assignment.add"
] | 910,774 | 910,775 | u888717396 | cpp |
p03103 | #include <iostream>
#include <map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
map<long int, long int> A;
long int a;
long int b;
for (int l = 0; l < N; l++) {
cin >> a >> b;
A.insert(make_pair(a, b));
}
long long sumMoney = 0;
for (auto i = A.begin(); i != A.end(); ++i) {
... | #include <iostream>
#include <map>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
multimap<long int, long int> A;
long int a;
long int b;
for (int l = 0; l < N; l++) {
cin >> a >> b;
A.insert(make_pair(a, b));
}
long long sumMoney = 0;
for (auto i = A.begin(); i != A.end(); ++i) {... | [
"variable_declaration.type.change"
] | 910,776 | 910,777 | u120564432 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<tuple<int, int>> data;
int data_a, data_b;
for (int i = 0; i < N; i++) {
cin >> data_a >> data_b;
data.emplace_back(data_a, data_b);
}
sort(begin(data), e... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<tuple<long, long>> data;
long data_a, data_b;
for (int i = 0; i < N; i++) {
cin >> data_a >> data_b;
data.emplace_back(data_a, data_b);
}
sort(begin(data)... | [
"variable_declaration.type.primitive.change"
] | 910,778 | 910,779 | u680707192 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> A(N);
for (int i = 0; i < N; i++) {
int B, C;
cin >> B >> C;
A[i] = make_pair(B, C);
}
sort(A.begin(), A.end());
int C = 0;
for (int... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<long int, long int>> A(N);
for (int i = 0; i < N; i++) {
int B, C;
cin >> B >> C;
A[i] = make_pair(B, C);
}
sort(A.begin(), A.end());
long long i... | [
"variable_declaration.type.widen.change"
] | 910,780 | 910,781 | u860597287 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// input
int N, M;
cin >> N >> M;
vector<pair<long int, int>> x(N);
for (int i = 0; i < N; i++) {
cin >> x[i].first >> x[i].first;
}
// compute
long int sum = 0l;
sort(x.begin(), x.end());
for (int i =... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
// input
int N, M;
cin >> N >> M;
vector<pair<long int, int>> x(N);
for (int i = 0; i < N; i++) {
cin >> x[i].first >> x[i].second;
}
// compute
long int sum = 0l;
sort(x.begin(), x.end());
for (int i ... | [
"expression.operation.binary.change"
] | 910,782 | 910,783 | u254766083 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i;
cin >> n >> m;
vector<pair<int, int>> vc(n);
for (i = 0; i < n; i++) {
cin >> vc[i].first >> vc[i].second;
}
sort(vc.begin(), vc.end());
long price = 0;
for (i = 0; m > 0; i++) {
price += vc[i].first * min(m, vc[i].s... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, m;
int i;
cin >> n >> m;
vector<pair<long, long>> vc(n);
for (i = 0; i < n; i++) {
cin >> vc[i].first >> vc[i].second;
}
sort(vc.begin(), vc.end());
long price = 0;
for (i = 0; m > 0; i++) {
price += vc[i].first * min(m... | [
"variable_declaration.type.primitive.change"
] | 910,784 | 910,785 | u653837719 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long costs[100000] = {};
map<int, int> mp;
for (int i = 0; i < n; ++i) {
cin >> costs[i];
int a;
cin >> a;
if (mp.find(costs[i]) == mp.end()) {
mp[costs[i]] += a;
... | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
long long costs[100000] = {};
map<int, int> mp;
for (int i = 0; i < n; ++i) {
cin >> costs[i];
int a;
cin >> a;
if (mp.find(costs[i]) != mp.end()) {
mp[costs[i]] += a;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 910,788 | 910,789 | u691380397 | cpp |
p03103 | #pragma region _head
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#pragma region _define
#define f(i, a, b) for (LL i = a; i < b; i++)
#define f_vI(v, n) f(i, 0, ... | #pragma region _head
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#pragma region _define
#define f(i, a, b) for (LL i = a; i < b; i++)
#define f_vI(v, n) f(i, 0, ... | [
"variable_declaration.type.change"
] | 910,808 | 910,809 | u987267288 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct drink {
int price;
int number;
};
int main() {
vector<drink> drinks;
int N, M;
cin >> N >> M;
int n, p;
for (int i = 0; i < N; i++) {
drink d;
cin >> d.price >> d.number;
drinks.push_back(d);
}
sort(d... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct drink {
int price;
int number;
};
int main() {
vector<drink> drinks;
int N, M;
cin >> N >> M;
int n, p;
for (int i = 0; i < N; i++) {
drink d;
cin >> d.price >> d.number;
drinks.push_back(d);
}
sort(d... | [
"type_conversion.add"
] | 910,824 | 910,825 | u262733088 | cpp |
p03103 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <ut... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <ut... | [] | 910,826 | 910,827 | u298980954 | cpp |
p03103 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> shop(N);
for (int i = 0; i < N; i++) {
i... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<long, int>> shop(N);
for (int i = 0; i < N; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 910,828 | 910,829 | u450733728 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> P(N);
int A, B;
for (int i = 0; i < N; i++) {
cin >> A >> B;
P[i] = make_pair(A, B);
}
sort(P.begin(), P.end());
int ans = 0;
for (int i = 0; i < N; i++) {
int buy = min(M, P[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> P(N);
int A, B;
for (int i = 0; i < N; i++) {
cin >> A >> B;
P[i] = make_pair(A, B);
}
sort(P.begin(), P.end());
long long ans = 0;
for (int i = 0; i < N; i++) {
int buy = min(M... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,830 | 910,831 | u319001729 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct SHOPINFO {
public:
int drincNum;
int drincPrice;
SHOPINFO() {
drincNum = 0;
drincPrice = 0;
}
SHOPINFO(int num, int price) {
drincNum = num;
drincPrice = price;
}
};
bool priceLow(SHOPI... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct SHOPINFO {
public:
long long drincNum;
long long drincPrice;
SHOPINFO() {
drincNum = 0;
drincPrice = 0;
}
SHOPINFO(int num, int price) {
drincNum = num;
drincPrice = price;
}
};
bool pr... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 910,834 | 910,835 | u376998218 | cpp |
p03099 | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int N = 405;
const int M = 100005;
const LL INF = 0x3f3f3f3f3f3f3f3f;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getch... | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int N = 405;
const int M = 100005;
const LL INF = 0x3f3f3f3f3f3f3f3f;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getch... | [
"variable_declaration.value.change",
"expression.operation.unary.remove"
] | 910,844 | 910,845 | u873618015 | cpp |
p03099 | #include <bits/stdc++.h>
#define LOG(FMT...) fprintf(stderr, FMT)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &... | #include <bits/stdc++.h>
#define LOG(FMT...) fprintf(stderr, FMT)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (T &... | [
"type_conversion.add"
] | 910,852 | 910,853 | u895067736 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.