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 9
values |
|---|---|---|---|---|---|---|---|
p02996 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
const long long INF = 1LL << 60;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
map<int, int> mp;
rep(i, n) {
int A, B;
cin >> A >> B;
mp[B] += A;
}
int sum = 0;
bool ans = true;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
const long long INF = 1LL << 60;
ll mod = 1e9 + 7;
int main() {
int n;
cin >> n;
map<int, int> mp;
rep(i, n) {
int A, B;
cin >> A >> B;
mp[B] += A;
}
int sum = 0;
bool ans = true;... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 806,760 | 806,761 | u848518411 | cpp |
p02996 | #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... | [
"literal.string.change",
"io.output.change"
] | 806,762 | 806,763 | u395287054 | cpp |
p02996 | /*
* Author : Sadi
* Fri 24/07/2020
* 17:44:08.69
*/
#include <bits/stdc++.h>
using namespace std;
#define watch(x) \
; \
cout << "\n" << #x << " is: " << x << "\n";
#define... | /*
* Author : Sadi
* Fri 24/07/2020
* 17:44:08.69
*/
#include <bits/stdc++.h>
using namespace std;
#define watch(x) \
; \
cout << "\n" << #x << " is: " << x << "\n";
#define... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,782 | 806,783 | u055538052 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int INF = 1e9 + 7;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<P> AB(N);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
AB[i].first = B;
AB[i].second = A;
}
sort(AB.begin(), AB.end());
int cnt = 0;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int INF = 1e9 + 7;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
vector<P> AB(N);
for (int i = 0; i < N; i++) {
int A, B;
cin >> A >> B;
AB[i].first = B;
AB[i].second = A;
}
sort(AB.begin(), AB.end());
int cnt = 0;
for (int i = 0; i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,784 | 806,785 | u237390401 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
struct Data {
int A;
int B;
};
int main() {
int N;
std::cin >> N;
std::vector<Data> data(N);
for (int i = 0; i < N; i++) {
std::cin >> data[i].A >> data[i].B;
}
std:
sort(data.begi... | #include <algorithm>
#include <iostream>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
struct Data {
int A;
int B;
};
int main() {
int N;
std::cin >> N;
std::vector<Data> data(N);
for (int i = 0; i < N; i++) {
std::cin >> data[i].A >> data[i].B;
}
std:
sort(data.begi... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 806,788 | 806,789 | u382721013 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
struct Data {
int A;
int B;
};
int main() {
int N;
std::cin >> N;
std::vector<Data> data(N);
for (int i = 0; i < N; i++) {
std::cin >> data[i].A >> data[i].B;
}
std:
sort(data.begi... | #include <algorithm>
#include <iostream>
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
struct Data {
int A;
int B;
};
int main() {
int N;
std::cin >> N;
std::vector<Data> data(N);
for (int i = 0; i < N; i++) {
std::cin >> data[i].A >> data[i].B;
}
std:
sort(data.begi... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 806,790 | 806,789 | u382721013 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const int N = 200005;
int main() {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
scanf("%d", &n);
multiset<pair<int, int>> st;
bool no = false;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define pb push_back
const int N = 200005;
int main() {
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
scanf("%d", &n);
multiset<pair<int, int>> st;
bool no = false;
for (int i = 0; i... | [] | 806,797 | 806,798 | u183294751 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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 perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 806,801 | 806,802 | u722640678 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
// 配列の作成
vector<pair<int64_t, int64_t>> dat(N);
for (int64_t i = 0; i < N; i++) {
cin >> dat[i].second >> dat[i].first;
}
sort(dat.begin(), dat.end());
// 0がB,1がA 昇順
int64_t t;
for (int64_t i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
// 配列の作成
vector<pair<int64_t, int64_t>> dat(N);
for (int64_t i = 0; i < N; i++) {
cin >> dat[i].second >> dat[i].first;
}
sort(dat.begin(), dat.end());
// 0がB,1がA 昇順
int64_t t = 0;
for (int64_t i = 0; i < N; i++) {
... | [
"variable_declaration.value.change"
] | 806,807 | 806,808 | u831603488 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
// 配列の作成
vector<pair<int64_t, int64_t>> dat(N);
for (int64_t i = 0; i < N; i++) {
cin >> dat[i].second >> dat[i].first;
}
sort(dat.begin(), dat.end());
// 0がB,1がA 昇順
int64_t t;
for (int64_t i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
// 配列の作成
vector<pair<int64_t, int64_t>> dat(N);
for (int64_t i = 0; i < N; i++) {
cin >> dat[i].second >> dat[i].first;
}
sort(dat.begin(), dat.end());
// 0がB,1がA 昇順
int64_t t = 0;
for (int64_t i = 0; i < N; i++) {
... | [
"variable_declaration.value.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 806,809 | 806,808 | u831603488 | cpp |
p02996 | // Author- VMAX
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset \
tree<long long, null_type, less_equal<long long>, rb_tree_tag, \
tre... | // Author- VMAX
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset \
tree<long long, null_type, less_equal<long long>, rb_tree_tag, \
tre... | [
"variable_declaration.type.change"
] | 806,814 | 806,815 | u251432619 | cpp |
p02996 | #include <bits/stdc++.h>
#define int long long
#define INF 1ll << 60
using namespace std;
bool cmd(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<pair<int, int>> vet(N);
int a, b;
... | #include <bits/stdc++.h>
#define int long long
#define INF 1ll << 60
using namespace std;
bool cmd(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<pair<int, int>> vet(N);
int a, b;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.unary.arithmetic.remove"
] | 806,823 | 806,824 | u018679195 | cpp |
p02996 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
const long long maxn = 1e6;
struct Node {
int ai, bi;
} node[maxn];
bool cmp(Node a, Node b) {
if (a.bi == b.bi)
return a.ai < b.ai;
return a.bi < b.bi;
}
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
const long long maxn = 1e6;
struct Node {
int ai, bi;
} node[maxn];
bool cmp(Node a, Node b) {
if (a.bi == b.bi)
return a.ai < b.ai;
return a.bi < b.bi;
}
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 806,825 | 806,826 | u089230684 | cpp |
p02996 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
const long long maxn = 1e6;
struct Node {
int ai, bi;
} node[maxn];
bool cmp(Node a, Node b) {
if (a.bi == b.bi)
return a.ai < b.ai;
return a.bi < b.bi;
}
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n;
const long long maxn = 1e6;
struct Node {
int ai, bi;
} node[maxn];
bool cmp(Node a, Node b) {
if (a.bi == b.bi)
return a.ai < b.ai;
return a.bi < b.bi;
}
int main(void) {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 806,825 | 806,827 | u089230684 | cpp |
p02996 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
ll gcd(... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long int;
const int mod = 1e9 + 7;
#define rep(i, a, b) for (ll i = a; i < b; i++)
ll gcd(... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 806,846 | 806,847 | u870074807 | cpp |
p02996 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 806,860 | 806,861 | u852449189 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
int main() {... | #include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
return (a.second < b.second);
}
int main() {... | [
"variable_declaration.type.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,874 | 806,875 | u819054341 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int>> tasks;
int main() {
int i = 0;
cin >> n;
while (i < n) {
int a, b;
cin >> a, b;
tasks.emplace_back(b, a);
i++;
}
sort(tasks.begin(), tasks.end());
int aa = 0;
int bb = 0;
int yy = 0;
for (auto v : tasks) ... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int, int>> tasks;
int main() {
int i = 0;
cin >> n;
while (i < n) {
int a, b;
cin >> a >> b;
tasks.emplace_back(b, a);
i++;
}
sort(tasks.begin(), tasks.end());
int aa = 0;
int bb = 0;
int yy = 0;
for (auto v : tasks... | [] | 806,876 | 806,877 | u437779154 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<P> table(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
table.at(i) = make_pair(b, a);
}
sort(table.begin(), table.end());
int sum = 0;
bool ok = true;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<P> table(n);
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
table.at(i) = make_pair(b, a);
}
sort(table.begin(), table.end());
int sum = 0;
bool ok = true;
for (int i = 0; ... | [
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 806,878 | 806,879 | u331498629 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i... | [
"assignment.value.change"
] | 806,880 | 806,881 | u330661451 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | [
"control_flow.branch.if.condition.change"
] | 806,885 | 806,886 | u790461875 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define MEMSET(v, h) memset((v), h, sizeof(v))
typedef long long ll;
using namespace std;
int main(... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define MEMSET(v, h) memset((v), h, sizeof(v))
typedef long long ll;
using namespace std;
int main(... | [] | 806,887 | 806,888 | u563743611 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> P;
#define int long long
#define override_rep(i, l, r, mes, ...) mes
#define rep1(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = l; i < r; i++)
#define rep(...) override_rep(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
templ... | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> P;
#define int long long
#define override_rep(i, l, r, mes, ...) mes
#define rep1(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = l; i < r; i++)
#define rep(...) override_rep(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
templ... | [
"assignment.value.change"
] | 806,891 | 806,892 | u073057072 | cpp |
p02996 | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
vector<pair<ll, ll>> v(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
v[i].first = b[i];
v[i].second = a[i];
}
sort(v.begin(), v.end());
ll c = 0;
... | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
vector<pair<ll, ll>> v(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
v[i].first = b[i];
v[i].second = a[i];
}
sort(v.begin(), v.end());
ll c = 0;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,901 | 806,902 | u022688266 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = INT64_MAX;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll... | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = INT64_MAX;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll... | [
"literal.number.change",
"variable_declaration.value.change"
] | 806,903 | 806,904 | u896014917 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
cin >> N;
vector<pair<int, int>> AB;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
AB.emplace_back(b, a); //締め切り、所要時間
}
sort(AB.begin(), AB.end());
bool judge = true;
ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
cin >> N;
vector<pair<int, int>> AB;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
AB.emplace_back(b, a); //締め切り、所要時間
}
sort(AB.begin(), AB.end());
bool judge = true;
ll ... | [
"assignment.value.change"
] | 806,905 | 806,906 | u574687269 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
cin >> N;
vector<pair<int, int>> AB;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
AB.emplace_back(b, a); //締め切り、所要時間
}
sort(AB.begin(), AB.end());
bool judge = true;
ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int N;
cin >> N;
vector<pair<int, int>> AB;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
AB.emplace_back(b, a); //締め切り、所要時間
}
sort(AB.begin(), AB.end());
bool judge = true;
ll ... | [
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 806,907 | 806,906 | u574687269 | cpp |
p02996 | #include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
#define db double
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vpi vector<pi>
#define vpl vector<pl>
#define pb push_back
#define er erase
#define SZ(x) (int)x.size... | #include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
#define db double
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vpi vector<pi>
#define vpl vector<pl>
#define pb push_back
#define er erase
#define SZ(x) (int)x.size... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 806,910 | 806,911 | u972930477 | cpp |
p02996 | #include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
#define db double
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vpi vector<pi>
#define vpl vector<pl>
#define pb push_back
#define er erase
#define SZ(x) (int)x.size... | #include <bits/stdc++.h>
#define reg register
#define ll long long
#define ull unsigned long long
#define db double
#define pi pair<int, int>
#define pl pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vpi vector<pi>
#define vpl vector<pl>
#define pb push_back
#define er erase
#define SZ(x) (int)x.size... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change",
"control_flow.return.add"
] | 806,912 | 806,911 | u972930477 | cpp |
p02996 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,940 | 806,941 | u845000384 | cpp |
p02996 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = int(n); i < i##_len; ++i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<... | [
"literal.string.change",
"io.output.change"
] | 806,942 | 806,943 | u203033720 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define traverse(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
typedef long long ll;
int main() {
// freopen("in.txt","r",stdin);
ll time = 0;
int n;
cin >> n;
multimap<int, int> j... | #include <bits/stdc++.h>
using namespace std;
#define traverse(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
typedef long long ll;
int main() {
// freopen("in.txt","r",stdin);
ll time = 0;
int n;
cin >> n;
multimap<int, int> j... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,950 | 806,951 | u887563701 | cpp |
p02996 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
ll s = 0;
rep(i, n) {
s += p[i].first;
if (s > p[i].se... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
ll s = 0;
rep(i, n) {
s += p[i].second;
if (s > p[i].f... | [
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 806,959 | 806,960 | u147556624 | cpp |
p02996 | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int n;
pair<int, int> a[200100];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i].first = y;
a[i].second = x;
}
sort(a, a + n);
ll T = 0;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int n;
pair<int, int> a[200100];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i].first = y;
a[i].second = x;
}
sort(a, a + n);
ll T = 0;
for (int i = 0; i < n; i++) {
... | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 806,961 | 806,962 | u365917065 | cpp |
p02996 | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int n;
pair<int, int> a[200100];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i].first = y;
a[i].second = x;
}
sort(a, a + n);
int T = 0;
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int n;
pair<int, int> a[200100];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
a[i].first = y;
a[i].second = x;
}
sort(a, a + n);
ll T = 0;
for (int i = 0; i < n; i++) {
... | [
"variable_declaration.type.change",
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.change"
] | 806,963 | 806,962 | u365917065 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> P;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> P;
typedef ... | [] | 806,966 | 806,967 | u358859892 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> P;
typedef ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> P;
typedef ... | [
"variable_declaration.type.change"
] | 806,968 | 806,967 | u358859892 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define l long long
int main() {
int n;
cin >> n;
l a, b;
vector<pair<l, l>> p;
for (int i = 0; i < n; i++) {
cin >> a >> b;
p.push_back({b, a});
}
l sum = 0;
int flag = 0;
sort(p.begin(), p.end());
for (int i = 0; i < n; i++) {
sum += p[i].s... | #include <bits/stdc++.h>
using namespace std;
#define l long long
int main() {
int n;
cin >> n;
l a, b;
vector<pair<l, l>> p;
for (int i = 0; i < n; i++) {
cin >> a >> b;
p.push_back({b, a});
}
l sum = 0;
int flag = 0;
sort(p.begin(), p.end());
for (int i = 0; i < n; i++) {
sum += p[i].s... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 806,975 | 806,976 | u269804852 | cpp |
p02986 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef pair<i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
using namespace std;
typedef long long int ll;
typedef pair<i... | [
"call.arguments.change"
] | 807,018 | 807,019 | u791593901 | cpp |
p02986 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fir first
#define sec second
#define Mp make_pair
const int MAXN = 1e5 + 5;
const int MAXM = 1e5 + 5;
const int LB = 20 + 5;
struct Edge {
int next, to, c, w;
} e[MAXN << 1];
int he... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fir first
#define sec second
#define Mp make_pair
const int MAXN = 1e5 + 5;
const int MAXM = 1e5 + 5;
const int LB = 20 + 5;
struct Edge {
int next, to, c, w;
} e[MAXN << 1];
int he... | [
"literal.number.change",
"call.arguments.change"
] | 807,051 | 807,052 | u042689916 | cpp |
p02986 | /*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB ... | /*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,059 | 807,060 | u904221771 | cpp |
p02986 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#inclu... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#inclu... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 807,065 | 807,066 | u426397594 | cpp |
p02986 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 807,075 | 807,074 | u751741878 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
#define y1 y11
#define fi first
#define se second
#define pi acos(-1.0)
#define LL long long
//#define mp make_pair
#define pb emplace_back
#define ls rt << 1, l, m
#define rs rt << 1 | 1, m + 1, r
#define ULL unsigned LL
#define pll pair<LL, LL>
#define pli pair<LL, int>
#... | #include <bits/stdc++.h>
using namespace std;
#define y1 y11
#define fi first
#define se second
#define pi acos(-1.0)
#define LL long long
//#define mp make_pair
#define pb emplace_back
#define ls rt << 1, l, m
#define rs rt << 1 | 1, m + 1, r
#define ULL unsigned LL
#define pll pair<LL, LL>
#define pli pair<LL, int>
#... | [
"literal.number.change",
"expression.operation.binary.change"
] | 807,079 | 807,080 | u645018082 | cpp |
p02986 | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 807,096 | 807,095 | u378419207 | cpp |
p02986 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
const int MV = 1e5 + 5;
const int MB = 20;
struct Edge {
int v, c, d;
Edge(int v = 0, int c = 0, int d = 0) : v(v), c(c), d(d) {}
};
vector<Edge> g[MV];
i... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
const int MV = 1e5 + 5;
const int MB = 20;
struct Edge {
int v, c, d;
Edge(int v = 0, int c = 0, int d = 0) : v(v), c(c), d(d) {}
};
vector<Edge> g[MV];
i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 807,099 | 807,100 | u138879272 | cpp |
p02986 | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | [
"assignment.change"
] | 807,103 | 807,104 | u284124505 | cpp |
p02986 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>... | [
"expression.operation.binary.add"
] | 807,119 | 807,120 | u816587940 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// BEGIN CUT HERE
class EulerTourForEdge {
private:
vector<... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// BEGIN CUT HERE
class EulerTourForEdge {
private:
vector<... | [
"expression.operation.binary.add"
] | 807,129 | 807,130 | u687214625 | cpp |
p02986 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;
const int maxn = 2e5 + 15;
int n, Q, a, b, c, d, cnt, head[maxn];
struct edge {
int to, nxt, col, len;
} e[maxn << 1];
pii p[maxn];
inline void add(int u, int v, int c, int d) {
e[++cnt] = (edge){v, head[u],... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;
const int maxn = 2e5 + 15;
int n, Q, a, b, c, d, cnt, head[maxn];
struct edge {
int to, nxt, col, len;
} e[maxn << 1];
pii p[maxn];
inline void add(int u, int v, int c, int d) {
e[++cnt] = (edge){v, head[u],... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 807,157 | 807,158 | u593546783 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
#define SZ(a) (int)(a.size())
#define PB push_back
#define LL long long
#define X first
#define Y second
const int MAX = 100005;
const int MAGIC = 100000;
vector<vector<pair<int, pair<int, int>>>> g(MAX);
int timer;
int cnt[MAX];
int tin[MAX];
int tout[MAX];
int D[MAX];
in... | #include <bits/stdc++.h>
using namespace std;
#define SZ(a) (int)(a.size())
#define PB push_back
#define LL long long
#define X first
#define Y second
const int MAX = 100005;
const int MAGIC = 350;
vector<vector<pair<int, pair<int, int>>>> g(MAX);
int timer;
int cnt[MAX];
int tin[MAX];
int tout[MAX];
int D[MAX];
int d... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add",
"call.arguments.change"
] | 807,182 | 807,183 | u804093140 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
#define SZ(a) (int)(a.size())
#define PB push_back
#define LL long long
#define X first
#define Y second
const int MAX = 100005;
const int MAGIC = 350;
vector<vector<pair<int, pair<int, int>>>> g(MAX);
int timer;
int cnt[MAX];
int tin[MAX];
int tout[MAX];
int D[MAX];
int d... | #include <bits/stdc++.h>
using namespace std;
#define SZ(a) (int)(a.size())
#define PB push_back
#define LL long long
#define X first
#define Y second
const int MAX = 100005;
const int MAGIC = 350;
vector<vector<pair<int, pair<int, int>>>> g(MAX);
int timer;
int cnt[MAX];
int tin[MAX];
int tout[MAX];
int D[MAX];
int d... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add",
"call.arguments.change"
] | 807,184 | 807,183 | u804093140 | cpp |
p02986 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD (ll)(1e9 + 7)
ll N, Q;
vector<pair<ll, pll>> abv[101010];
ll d[... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD (ll)(1e9 + 7)
ll N, Q;
vector<pair<ll, pll>> abv[101010];
ll d[... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,197 | 807,198 | u259396003 | cpp |
p02986 | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD (ll)(1e9 + 7)
ll N, Q;
vector<pair<ll, pll>> abv[101010];
ll d[... | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define MOD (ll)(1e9 + 7)
ll N, Q;
vector<pair<ll, pll>> abv[101010];
ll d[... | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"assignment.change"
] | 807,199 | 807,198 | u259396003 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int lg = 21;
int n, q;
int d[100100];
int up[100100][22];
int col[100100];
ll cost[100100];
ll ans[100100];
int cnt[100100];
ll col_dist[100100];
vector<int> adj[100100];
vector<ll> weight[100100];
vector<int> color[100100];
vector<int> query... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int lg = 21;
int n, q;
int d[100100];
int up[100100][22];
int col[100100];
ll cost[100100];
ll ans[100100];
int cnt[100100];
ll col_dist[100100];
vector<int> adj[100100];
vector<ll> weight[100100];
vector<int> color[100100];
vector<int> query... | [
"expression.operation.binary.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 807,200 | 807,201 | u313597494 | cpp |
p02996 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<pair<int, int>> v;
cin >> n;
for (int x, y, i = 0; i < n; i++) {
cin >> x >> y;
v.push_back({y, x});
}
sort(v.begin(), v.end());
int cur = 0;
for (int i = 0; i < n; i++) {
cur += v[i].second;
if (cur > v[i].first)... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
vector<pair<int, int>> v;
cin >> n;
for (int x, y, i = 0; i < n; i++) {
cin >> x >> y;
v.push_back({y, x});
}
sort(v.begin(), v.end());
int cur = 0;
for (int i = 0; i < n; i++) {
cur += v[i].second;
if (cur > v[i].first)... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,236 | 807,237 | u025394570 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<pair<long long, long long>> ba(n);
for (int i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
ba.at(i).first = b;
ba.at(i).second = a;
}
sort(ba.begin(), ba.end());
long long sum = 0;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<pair<long long, long long>> ba(n);
for (int i = 0; i < n; i++) {
long long a, b;
cin >> a >> b;
ba.at(i).first = b;
ba.at(i).second = a;
}
sort(ba.begin(), ba.end());
long long sum = 0;
for (int i =... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,240 | 807,239 | u431602218 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#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) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
#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) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin... | [] | 807,246 | 807,247 | u722397179 | cpp |
p02996 | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
pair<long long int, long long int> work[n];
for (int i = 0; i... | #include <algorithm> //sort,reverse
#include <deque> //double_ended queue
#include <iostream>
#include <queue> //queue,priority queue
#include <string>
#include <utility> //pair
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
pair<long long int, long long int> work[n];
for (int i = 0; i... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 807,264 | 807,265 | u992779443 | cpp |
p02996 | // Code by Nguyen Huu Lam
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MaxN = 1 + 1e5;
LL n, t;
pair<LL, LL> a[MaxN];
void InOut() {
#define TASK "ABC"
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
int main() {
// InOut();
ios_base::sync_with_stdio(0)... | // Code by Nguyen Huu Lam
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL MaxN = 1 + 2e5;
LL n, t;
pair<LL, LL> a[MaxN];
void InOut() {
#define TASK "ABC"
freopen(TASK ".inp", "r", stdin);
freopen(TASK ".out", "w", stdout);
}
int main() {
// InOut();
ios_base::sync_with_stdio(0)... | [
"literal.number.change",
"expression.operation.binary.change",
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,268 | 807,267 | u165945806 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> p(N);
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
p.at(i) = make_pair(b, a); // b, a の順でペアにする
}
sort(p.begin(), p.end());
int time = 0;
int ss = 0;
int y = 0;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int, int>> p(N);
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
p.at(i) = make_pair(b, a); // b, a の順でペアにする
}
sort(p.begin(), p.end());
int time = 0;
int ss = 0;
int y = 0;
for (int i = 0; i... | [
"assignment.value.change"
] | 807,271 | 807,272 | u103850114 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPRl(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < (int)n; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPRl(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < (int)n; i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 807,273 | 807,274 | u882037708 | cpp |
p02996 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
using vi = vector<int>;
using vii = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
#define rep(i, n) for (int i = 0;... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,292 | 807,293 | u654115433 | cpp |
p02996 | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <util... | #include <algorithm>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <util... | [
"literal.string.change",
"io.output.change"
] | 807,296 | 807,297 | u342051078 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
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;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const... | #include <bits/stdc++.h>
using namespace std;
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;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const... | [
"call.arguments.change",
"call.arguments.add"
] | 807,298 | 807,299 | u747087681 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
map<int, ll> mp;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
mp[b] += a;
}
int lo = 0;
for (auto p : mp) {
int deadline = p.first;
ll len = p.second;
if (len < deadline - lo) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
map<int, ll> mp;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
mp[b] += a;
}
int lo = 0;
for (auto p : mp) {
int deadline = p.first;
ll len = p.second;
if (len > deadline - lo)... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 807,322 | 807,323 | u774417629 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
// 締め切りが早い順に片付ける以外の方法はない
int N;
cin >> N;
int timeSpent = 0;
string ans = "Yes";
unordered_map<int, vector<int>> dic; // {残り日数: [所要時間, 所要時間, ...]}
set<int> deadlines;
for (int i = 0; i < N; ++i) {
int A, B; // timeframe, deadline
cin... | #include <bits/stdc++.h>
using namespace std;
int main() {
// 締め切りが早い順に片付ける以外の方法はない
int N;
cin >> N;
int timeSpent = 0;
string ans = "Yes";
unordered_map<int, vector<int>> dic; // {残り日数: [所要時間, 所要時間, ...]}
set<int> deadlines;
for (int i = 0; i < N; ++i) {
int A, B; // timeframe, deadline
cin... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 807,326 | 807,327 | u833543158 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
// 締め切りが早い順に片付ける以外の方法はない
int N;
cin >> N;
int timeSpent = 0;
string ans = "Yes";
vector<pair<int, int>> jobs;
for (int i = 0; i < N; ++i) {
int A, B;
cin >> A >> B;
jobs.emplace_back(A, B);
}
sort(jobs.begin(), jobs.end());
... | #include <bits/stdc++.h>
using namespace std;
int main() {
// 締め切りが早い順に片付ける以外の方法はない
int N;
cin >> N;
int timeSpent = 0;
string ans = "Yes";
vector<pair<int, int>> jobs; // deadlineでソートするため(deadline, timeframe)
for (int i = 0; i < N; ++i) {
int A, B; // timeframe, deadline
cin >> A >> B;
jo... | [
"call.arguments.change",
"call.arguments.add"
] | 807,328 | 807,329 | u833543158 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<pair<int, int>> v;
int main() {
int n;
int i;
cin >> n;
for (i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
v.push_back({b, a});
}
sort(v.begin(), v.end());
int day = 0;
bool ans = 1;
for (auto p : v) {... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<pair<int, int>> v;
int main() {
int n;
int i;
cin >> n;
for (i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
v.push_back({b, a});
}
sort(v.begin(), v.end());
int day = 0;
bool ans = 1;
for (auto p : v) {... | [
"control_flow.branch.if.condition.change"
] | 807,330 | 807,331 | u359313068 | cpp |
p02996 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 1000000007
#define BOUND 27... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <type_traits>
#include <vector>
using namespace std;
#define INF (1ll << 60)
#define INFint (1 << 30)
#define MOD 1000000007
#define BOUND 27... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,332 | 807,333 | u991664217 | cpp |
p02996 | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int sz = 2e5 + 9;
int n;
pair<int, int> p[sz];
bool cmp(pair<int, int> a, pair<int, int> b) {
// if(a.x!=b.x) return a.x<b.x;
return a.y < b.y;
}
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int sz = 2e5 + 9;
int n;
pair<int, int> p[sz];
bool cmp(pair<int, int> a, pair<int, int> b) {
// if(a.x!=b.x) return a.x<b.x;
return a.y < b.y;
}
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 807,334 | 807,335 | u353783395 | cpp |
p02996 | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int sz = 2e5 + 9;
int n;
pair<int, int> p[sz];
bool cmp(pair<int, int> a, pair<int, int> b) {
// if(a.x!=b.x) return a.x<b.x;
return a.y < b.y;
}
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
... | #include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int sz = 2e5 + 9;
int n;
pair<int, int> p[sz];
bool cmp(pair<int, int> a, pair<int, int> b) {
// if(a.x!=b.x) return a.x<b.x;
return a.y < b.y;
}
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
... | [
"identifier.change",
"call.function.change",
"io.output.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 807,336 | 807,335 | u353783395 | cpp |
p02996 | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int MOD =... | #include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define pb push_back
#define ALL(obj) (obj).begin(), (obj).end()
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
typedef long long ll;
const int MOD =... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,348 | 807,349 | u067267922 | cpp |
p02996 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
int main(void) {
int n;
int t;
int i;
int x, y;
int flg;
P box[200001];
cin >> n;
for (i = 0; i < n; i++) {
cin >> x >> y;
box[i].F = y;
box[i].S = x;
}
sort(box, box + n);
// for(i... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef pair<int, int> P;
int main(void) {
int n;
int t;
int i;
int x, y;
int flg;
P box[200001];
cin >> n;
for (i = 0; i < n; i++) {
cin >> x >> y;
box[i].F = y;
box[i].S = x;
}
sort(box, box + n);
// for(i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,360 | 807,361 | u787972656 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct times {
int a;
int b;
};
int main() {
int n;
vector<times> time;
cin >> n;
for (int i = 0; i < n; i++) {
times t;
cin >> t.a >> t.b;
time.push_back(t);
}
sort(time.begin(), time.end(... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct times {
int a;
int b;
};
int main() {
int n;
vector<times> time;
cin >> n;
for (int i = 0; i < n; i++) {
times t;
cin >> t.a >> t.b;
time.push_back(t);
}
sort(time.begin(), time.end(... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,364 | 807,365 | u020230257 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct times {
int a;
int b;
};
int main() {
int n;
vector<times> time;
cin >> n;
for (int i = 0; i < n; i++) {
times t;
cin >> t.a >> t.b;
time.push_back(t);
}
sort(time.begin(), time.end(... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct times {
int a;
int b;
};
int main() {
int n;
vector<times> time;
cin >> n;
for (int i = 0; i < n; i++) {
times t;
cin >> t.a >> t.b;
time.push_back(t);
}
sort(time.begin(), time.end(... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,366 | 807,365 | u020230257 | cpp |
p02996 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <vector>
using namespace std;
int main() {
long long N, tmp1, tmp2;
long long A[200000], B[200000];
cin >> N;
vector<pair<long long, long long>> v(N);
for (int i = 0; i < N; i++) {
cin >> tmp1 >> tmp2;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <numeric>
#include <vector>
using namespace std;
int main() {
long long N, tmp1, tmp2;
long long A[200000], B[200000];
cin >> N;
vector<pair<long long, long long>> v(N);
for (int i = 0; i < N; i++) {
cin >> tmp1 >> tmp2;... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,383 | 807,384 | u817999507 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
class Job {
public:
int a;
int b;
};
bool operator<(const Job &left, const Job &right) { return left.b < right.b; }
bool operator>(const Job &left, const Job &right) { return left.b > right.b; }
int main() {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
class Job {
public:
int a;
int b;
};
bool operator<(const Job &left, const Job &right) { return left.b < right.b; }
bool operator>(const Job &left, const Job &right) { return left.b > right.b; }
int main() {
... | [
"control_flow.break.add"
] | 807,385 | 807,386 | u056123277 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<P> lis;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
lis.push_back(P(b, a));
}
sort(lis.begin(), lis.end());
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<P> lis;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
lis.push_back(P(b, a));
}
sort(lis.begin(), lis.end());
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 807,387 | 807,388 | u525137785 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<P> lis;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
lis.push_back(P(b, a));
}
sort(lis.begin(), lis.end());
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<P> lis;
for (int i = 0; i < N; i++) {
ll a, b;
cin >> a >> b;
lis.push_back(P(b, a));
}
sort(lis.begin(), lis.end());
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"assignment.value.change"
] | 807,389 | 807,388 | u525137785 | cpp |
p02996 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
// const ll RANDOM =
// chrono::high_resolution_clock::now().time_since_epoch().count();
// gp_hash_table<int, int>... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
// const ll RANDOM =
// chrono::high_resolution_clock::now().time_since_epoch().count();
// gp_hash_table<int, int>... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 807,394 | 807,395 | u653136790 | cpp |
p02996 | #include "bits/stdc++.h"
using namespace std;
#define eb emplace_back
#define all(x) begin(x), end(x)
#define log(x) cout << (x) << endl
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using pi = pair<int, int>;
using vpi = vector<pi>;
using ll = long long;
int main() {
int n, a, b;
cin >> n;
vpi tasks;
... | #include "bits/stdc++.h"
using namespace std;
#define eb emplace_back
#define all(x) begin(x), end(x)
#define log(x) cout << (x) << endl
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using pi = pair<int, int>;
using vpi = vector<pi>;
using ll = long long;
int main() {
int n, a, b;
cin >> n;
vpi tasks;
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"function.return_value.change"
] | 807,401 | 807,402 | u774380666 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
int main() {
int N;
vector<pair<ll, ll>> AB(N);
rep(i, 0, N) { cin >> AB[i].second >> AB[i].first; }
sort(AB.begin(), AB.end());
ll cntA = 0;
ll deadline = 0;
bool success = true... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
int main() {
int N;
cin >> N;
vector<pair<ll, ll>> AB(N);
rep(i, 0, N) { cin >> AB[i].second >> AB[i].first; }
sort(AB.begin(), AB.end());
ll cntA = 0;
ll deadline = 0;
bool su... | [] | 807,409 | 807,410 | u987594251 | cpp |
p02996 | #include <bits/stdc++.h>
#include <cstdio>
#define pb push_back
#define endl "\n"
#define mostrar(x, y) cout << x << " " << y << endl;
#define f first
#define s second
#define mod 1000000007
#define EPS 1e-9
using namespace std;
typedef pair<int, int> ii;
typedef pair<pair<int, int>, int> iii;
typedef vector<int> vi;
t... | #include <bits/stdc++.h>
#include <cstdio>
#define pb push_back
#define endl "\n"
#define mostrar(x, y) cout << x << " " << y << endl;
#define f first
#define s second
#define mod 1000000007
#define EPS 1e-9
using namespace std;
typedef pair<int, int> ii;
typedef pair<pair<int, int>, int> iii;
typedef vector<int> vi;
t... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,417 | 807,418 | u594272051 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
vector<int> ord(N);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int x, int y) { return B[x] < B[y]; });
bool ans = true;
int t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
vector<int> ord(N);
iota(ord.begin(), ord.end(), 0);
sort(ord.begin(), ord.end(), [&](int x, int y) { return B[x] < B[y]; });
bool ans = true;
int t... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,446 | 807,447 | u689245321 | cpp |
p02996 | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<long, long>> p(n);
for (int i = 0; i < n; i++) {
long a, b;
cin >> a >> b;
p.push_back(make_pair(b, a));
}
sort(p.begin(), p.end());
long lapse = 0;... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<long, long>> p(n);
for (int i = 0; i < n; i++) {
long a, b;
cin >> a >> b;
p[i] = make_pair(b, a);
}
sort(p.begin(), p.end());
long lapse = 0;
boo... | [
"call.arguments.change"
] | 807,465 | 807,466 | u093744128 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); ... | [
"control_flow.return.add"
] | 807,469 | 807,470 | u988882661 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define fast \
ios_base::sync_with_stdio(false); ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 807,471 | 807,470 | u988882661 | cpp |
p02996 | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
//#endif
lon... | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
//#ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
//#endif
lon... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,475 | 807,476 | u175989198 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
struct kkk {
long long t;
long long s;
long long start;
} a[200005];
int cmp(kkk aa, kkk bb) {
/* if(aa.start==bb.start){
return aa.s<bb.s;
}
*/ return aa.s < bb.s;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
struct kkk {
long long t;
long long s;
long long start;
} a[200005];
int cmp(kkk aa, kkk bb) {
/* if(aa.start==bb.start){
return aa.s<bb.s;
}
*/ return aa.s < bb.s;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
... | [
"literal.string.change",
"io.output.change"
] | 807,477 | 807,478 | u261868146 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; i++) {
ll l, r;
cin >> l >> r;
v.push_back(make_pair(r, l));
}
ll sum = 0;
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
// cout<<v[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; i++) {
ll l, r;
cin >> l >> r;
v.push_back(make_pair(r, l));
}
ll sum = 0;
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
// cout<<v[i... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,481 | 807,482 | u432205669 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
bool com(pair<ll, ll> p1, pair<ll, ll> p2) {
if (p1.first < p2.first) {
return true;
}
if (p1.first == p2.second) {
return (p1.second <= p2.second);
}
return 0;
}
int main() {
int n;
cin >> n;
ll x, y, tot = 0;
ll cur[n... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
bool com(pair<ll, ll> p1, pair<ll, ll> p2) {
if (p1.second < p2.second) {
return true;
}
if (p1.second == p2.second) {
return (p1.first <= p2.first);
}
return false;
}
int main() {
int n;
cin >> n;
ll x, y, tot = 0;
ll ... | [
"control_flow.branch.if.condition.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,491 | 807,492 | u422827820 | cpp |
p02996 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
static const int IINF = 1 << 30;
static const long long LINF = 1LL << 60;
static const long long MOD = 1.0e+9 + 7;
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
templ... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <vector>
static const int IINF = 1 << 30;
static const long long LINF = 1LL << 60;
static const long long MOD = 1.0e+9 + 7;
template <typename T> std::vector<T> vectors(std::size_t n, T val) {
return std::vector<T>(n, val);
}
templ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 807,493 | 807,494 | u875972329 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long a, b;
vector<pair<long, long>> v;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({b, a});
}
sort(v.begin(), v.end());
int flg = 0;
long t = 0;
for (long i = 0; i < n; i++) {
a = v[i].first;
b ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
long a, b;
vector<pair<long, long>> v;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back({b, a});
}
sort(v.begin(), v.end());
int flg = 0;
long t = 0;
for (long i = 0; i < n; i++) {
a = v[i].first;
b ... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,505 | 807,506 | u922317157 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 100;
int a[N], b[N], arr[N];
int n, t;
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
arr[i] = i;
}
sort(arr, arr + n, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 100;
int a[N], b[N], arr[N];
int n, t;
int32_t main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
arr[i] = i;
}
sort(arr, arr + n, ... | [
"literal.string.change",
"literal.string.case.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 807,520 | 807,521 | u649712004 | cpp |
p02996 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
long long t = 0;
rep(i, n) {
t += p[i].second;
if (t > p[i].first) {
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
long long t = 0;
rep(i, n) {
t += p[i].second;
if (t > p[i].first) {
c... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 807,530 | 807,531 | u367177642 | cpp |
p02996 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(... | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(... | [
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 807,553 | 807,554 | u966508131 | cpp |
p02996 | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(... | #include <algorithm>
#include <cstdlib>
#include <iomanip> //小数点以下を表示させる(setprecision())
#include <iostream> //入出力
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define debug(... | [] | 807,555 | 807,556 | u966508131 | cpp |
p02996 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [] | 807,572 | 807,573 | u468700753 | cpp |
p02996 | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// mi... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int, int> II;
typedef tuple<int, int, int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int, int> MAPII;
typedef unordered_set<int> SETI;
template <class T> using VV = vector<vector<T>>;
// mi... | [
"expression.operation.binary.remove"
] | 807,582 | 807,583 | u465317453 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.