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 |
|---|---|---|---|---|---|---|---|
p03038 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define FIND(v, x) (binary_search(ALL(v), (x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v) \
sort(ALL(v)); \
reverse(ALL(v))
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
template <class T> inline bool chmin(T &a, T b) {
return a > b ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, T b) {
return a < b ? a = b, true : false;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
struct BIT {
vector<ll> bit; // 1-indexed
int n;
BIT(int n) : n(n), bit(vector<ll>(n + 1, 0)) {}
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += (ll)x;
i += i & -i;
}
}
};
int main(void) {
int N, M;
cin >> N >> M;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
BIT bitA(N);
BIT bitB(N);
SORT(A);
REP(i, N) { bitA.add(i + 1, A[i]); }
vector<pii> cb(M);
REP(i, M) { cin >> cb[i].se >> cb[i].fi; }
RSORT(cb);
int it = 1;
REP(i, M) {
REP(j, cb[i].se) {
bitB.add(it++, cb[i].fi);
if (it > N)
break;
}
if (it > N)
break;
}
ll ans = 0;
REP(i, N) { ans = max(ans, bitA.sum(N) - bitA.sum(i + 1) + bitB.sum(i + 1)); }
pr(ans);
// int N,M;
// cin >> N >> M;
// vector<ll> A(N);
// vector<pii> AI(N);
// for (int i = 0; i < N; i++) {
// cin >> A[i];
// AI[i].fi = A[i];
// AI[i].se = i+1;
// }
// BIT bit(N);
// REP(i, N){
// bit.add(i+1, A[i]);
// }
// vector<pii> cb(M);
// REP(i, M){
// cin >> cb[i].se >> cb[i].fi;
// }
// SORT(AI);
// RSORT(cb);
// int ait = 0;
// REP(i, M){
// if(ait == N) break;
// REP(j, cb[i].se){
// if(AI[ait].fi < cb[i].fi){
// bit.add(AI[ait].se, cb[i].fi - A[AI[ait].se-1]);
// ait++;
// }else{
// break;
// }
// }
// }
// pr(bit.sum(N));
// return 0;
} | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define FIND(v, x) (binary_search(ALL(v), (x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v) \
sort(ALL(v)); \
reverse(ALL(v))
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
template <class T> inline bool chmin(T &a, T b) {
return a > b ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, T b) {
return a < b ? a = b, true : false;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
struct BIT {
vector<ll> bit; // 1-indexed
int n;
BIT(int n) : n(n), bit(vector<ll>(n + 1, 0)) {}
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += (ll)x;
i += i & -i;
}
}
};
int main(void) {
int N, M;
cin >> N >> M;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
BIT bitA(N);
BIT bitB(N);
SORT(A);
REP(i, N) { bitA.add(i + 1, A[i]); }
vector<pii> cb(M);
REP(i, M) { cin >> cb[i].se >> cb[i].fi; }
RSORT(cb);
int it = 1;
REP(i, M) {
REP(j, cb[i].se) {
bitB.add(it++, cb[i].fi);
if (it > N)
break;
}
if (it > N)
break;
}
ll ans = bitA.sum(N);
REP(i, N) { ans = max(ans, bitA.sum(N) - bitA.sum(i + 1) + bitB.sum(i + 1)); }
pr(ans);
// int N,M;
// cin >> N >> M;
// vector<ll> A(N);
// vector<pii> AI(N);
// for (int i = 0; i < N; i++) {
// cin >> A[i];
// AI[i].fi = A[i];
// AI[i].se = i+1;
// }
// BIT bit(N);
// REP(i, N){
// bit.add(i+1, A[i]);
// }
// vector<pii> cb(M);
// REP(i, M){
// cin >> cb[i].se >> cb[i].fi;
// }
// SORT(AI);
// RSORT(cb);
// int ait = 0;
// REP(i, M){
// if(ait == N) break;
// REP(j, cb[i].se){
// if(AI[ait].fi < cb[i].fi){
// bit.add(AI[ait].se, cb[i].fi - A[AI[ait].se-1]);
// ait++;
// }else{
// break;
// }
// }
// }
// pr(bit.sum(N));
// return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"call.add"
] | 853,358 | 853,359 | u528720841 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
const int MAXn = 1e5 + 10;
typedef pair<int, int> pii;
long long res, sum, pref, goodsum;
int n, ar[MAXn], m;
vector<pii> vec;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> ar[i];
sum += ar[i];
}
for (int i = 0; i < m; i++) {
pii hp;
cin >> hp.second >> hp.first;
vec.push_back(hp);
}
sort(vec.begin(), vec.end());
sort(ar, ar + n);
for (int i = 0; i < n; i++) {
if (vec.empty())
break;
pref += vec.back().first;
vec.back().second--;
if (vec.back().second == 0)
vec.pop_back();
goodsum += ar[i];
res = max(res, sum - goodsum + pref);
}
cout << res;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAXn = 1e5 + 10;
typedef pair<int, int> pii;
long long res, sum, pref, goodsum;
int n, ar[MAXn], m;
vector<pii> vec;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> ar[i];
sum += ar[i];
}
for (int i = 0; i < m; i++) {
pii hp;
cin >> hp.second >> hp.first;
vec.push_back(hp);
}
sort(vec.begin(), vec.end());
sort(ar, ar + n);
res = sum;
for (int i = 0; i < n; i++) {
if (vec.empty())
break;
pref += vec.back().first;
vec.back().second--;
if (vec.back().second == 0)
vec.pop_back();
goodsum += ar[i];
res = max(res, sum - goodsum + pref);
}
cout << res;
}
| [
"assignment.add"
] | 853,386 | 853,387 | u138661009 | cpp |
p03038 | using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define VEC(a, n) vector<int> a(n)
#define PQ(a) priority_queue<int> a
#define PQmin(a) priority_queue<int, : vector<int>, greater<int>> a
#define PAIR pair<int, int>
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define EPS (1e-7)
#define INF (1e10)
#define PI (acos(-1))
const ll mod = 1000000007;
bool f(string s) {
bool ans = true;
rep(i, s.size() / 2) {
if (s[i] != s[s.size() / 2 + i]) {
ans = false;
break;
}
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<l_l> pairs(M);
vector<ll> A(N);
rep(i, N) cin >> A[i];
rep(i, M) {
ll a;
ll b;
cin >> a >> b;
pairs[i] = make_pair(b, a);
}
sort all(pairs);
vector<ll> D(N);
int cnt = 0;
repr(i, M) {
rep(j, pairs[i].second) {
if (cnt == N)
break;
else {
D.push_back(pairs[i].first);
cnt++;
}
}
if (cnt == N)
break;
}
ll ans = 0;
sort all(D);
reverse all(D);
rep(i, N) { ans += max(A[i], D[i]); }
cout << ans << endl;
}
| using namespace std;
#include <bits/stdc++.h>
#define rep(i, s) for (int i = 0; i < s; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(v) (v.begin(), v.end())
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define VEC(a, n) vector<int> a(n)
#define PQ(a) priority_queue<int> a
#define PQmin(a) priority_queue<int, : vector<int>, greater<int>> a
#define PAIR pair<int, int>
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define EPS (1e-7)
#define INF (1e10)
#define PI (acos(-1))
const ll mod = 1000000007;
bool f(string s) {
bool ans = true;
rep(i, s.size() / 2) {
if (s[i] != s[s.size() / 2 + i]) {
ans = false;
break;
}
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<l_l> pairs(M);
vector<ll> A(N);
rep(i, N) cin >> A[i];
sort all(A);
rep(i, M) {
ll a;
ll b;
cin >> a >> b;
pairs[i] = make_pair(b, a);
}
sort all(pairs);
vector<ll> D(N);
int cnt = 0;
repr(i, M) {
rep(j, pairs[i].second) {
if (cnt == N)
break;
else {
D.push_back(pairs[i].first);
cnt++;
}
}
if (cnt == N)
break;
}
ll ans = 0;
sort all(D);
reverse all(D);
rep(i, N) { ans += max(A[i], D[i]); }
cout << ans << endl;
}
| [
"variable_declaration.add"
] | 853,400 | 853,401 | u535810324 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct node {
int ti, vi;
};
node no[maxn];
int n, m;
int a[maxn];
int sum;
bool cmp(node a, node b) { return a.vi > b.vi; }
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
// for(int i=1;i<=n;i++) cout<<a[i]<<endl;
for (int i = 1; i <= m; i++)
scanf("%d%d", &no[i].ti, &no[i].vi);
sort(no + 1, no + m + 1, cmp);
// for(int i=1;i<=m;i++) printf("%d\n",no[i].vi);
int p = 1;
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i] < no[p].vi)
a[i] = no[p].vi, cnt++;
if (cnt == no[p].ti) {
p++;
cnt = 0;
}
}
for (int i = 1; i <= n; i++)
sum += a[i];
printf("%d\n", sum);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
struct node {
int ti, vi;
};
node no[maxn];
int n, m;
int a[maxn];
long long sum;
bool cmp(node a, node b) { return a.vi > b.vi; }
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
// for(int i=1;i<=n;i++) cout<<a[i]<<endl;
for (int i = 1; i <= m; i++)
scanf("%d%d", &no[i].ti, &no[i].vi);
sort(no + 1, no + m + 1, cmp);
// for(int i=1;i<=m;i++) printf("%d\n",no[i].vi);
int p = 1;
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (a[i] < no[p].vi)
a[i] = no[p].vi, cnt++;
if (cnt == no[p].ti) {
p++;
cnt = 0;
}
}
for (int i = 1; i <= n; i++)
sum += a[i];
printf("%lld\n", sum);
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 853,412 | 853,413 | u660324536 | cpp |
p03038 | #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>> Cards(N + M);
for (ll i = 0; i < N; i++) {
Cards[i].second = 1;
cin >> Cards[i].first;
}
for (ll j = 0; j < M; j++) {
cin >> Cards[j + N].second >> Cards[j + N].first;
}
sort(Cards.begin(), Cards.end());
reverse(Cards.begin(), Cards.end());
ll cnt = 0;
ll i = 0;
ll sum = 0;
while (cnt <= N) {
sum += Cards[i].first * Cards[i].second;
cnt += Cards[i].second;
i++;
}
if (cnt > N) {
sum -= Cards[i].first * (cnt - N);
}
cout << sum << endl;
return 0;
}
| #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>> Cards(N + M);
for (ll i = 0; i < N; i++) {
Cards[i].second = 1;
cin >> Cards[i].first;
}
for (ll j = 0; j < M; j++) {
cin >> Cards[j + N].second >> Cards[j + N].first;
}
sort(Cards.begin(), Cards.end());
reverse(Cards.begin(), Cards.end());
ll cnt = 0;
ll i = 0;
ll sum = 0;
while (cnt <= N) {
sum += Cards[i].first * Cards[i].second;
cnt += Cards[i].second;
i++;
}
if (cnt > N) {
sum -= Cards[i - 1].first * (cnt - N);
}
cout << sum << endl;
return 0;
}
| [
"assignment.change"
] | 853,431 | 853,432 | u904123392 | cpp |
p03038 | #include <bits/stdc++.h>
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define out(x) cout << x << endl;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
template <typename T> vector<T> v1init(int len) {
vector<T> vec(vector<T>(len, 0));
return vec;
}
vector<string> v1init(int len) {
vector<string> vec(vector<string>(len, ""));
return vec;
}
template <typename T> T v1sum(vector<T> vec) {
T ret = 0;
for (int i = 0; i < vec.size(); i++)
ret += vec[i];
return ret;
}
template <typename T> vector<T> v1sort(vector<T> vec, bool min_to_max = true) {
sort(vec.begin(), vec.end(), [min_to_max](const T a, const T b) {
return (min_to_max == true) ? (a < b) : (b < a);
});
return vec;
}
template <typename T> void v1show(vector<T> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
cout << endl;
}
template <typename T> vector<vector<T>> v2init(int y_len, int x_len) {
vector<vector<T>> vec(y_len, vector<T>(x_len, 0));
return vec;
}
template <typename T>
vector<vector<T>> v2sort(vector<vector<T>> vec, int index) {
sort(vec.begin(), vec.end(), [index](const vector<T> a, const vector<T> b) {
return (a[index] > b[index]);
});
return vec;
}
template <typename T> void v2show(vector<vector<T>> vec) {
for (int i = 0; i < vec.size(); i++) {
for (int j = 0; j < vec[0].size(); j++) {
cout << vec[i][j] << " ";
}
cout << endl;
}
}
int main() {
int N, M;
cin >> N >> M;
auto a = v1init<ll>(N);
rep(i, N) { cin >> a[i]; }
auto vec = v2init<ll>(M, 2);
rep(i, M) { cin >> vec[i][0] >> vec[i][1]; }
vec = v2sort(vec, 1);
a = v1sort(a, false);
ll tmpmax = 0;
ll tmpnum = 0;
ll ans = 0;
int is_end = 0;
rep(i, M) {
rep(j, vec[i][0]) {
if (a[tmpmax] < vec[i][1] || tmpmax >= N) {
tmpnum++;
ans += vec[i][1];
} else {
tmpnum++;
ans += a[tmpmax];
tmpmax++;
j--;
}
// cout << ans << " " << tmpnum << " " << tmpmax << endl;
if (tmpnum == N) {
is_end = 1;
break;
}
}
if (is_end == 1) {
break;
}
}
for (int i = tmpnum; i < N; i++) {
ans += a[tmpmax];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define out(x) cout << x << endl;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
using namespace std;
template <typename T> vector<T> v1init(int len) {
vector<T> vec(vector<T>(len, 0));
return vec;
}
vector<string> v1init(int len) {
vector<string> vec(vector<string>(len, ""));
return vec;
}
template <typename T> T v1sum(vector<T> vec) {
T ret = 0;
for (int i = 0; i < vec.size(); i++)
ret += vec[i];
return ret;
}
template <typename T> vector<T> v1sort(vector<T> vec, bool min_to_max = true) {
sort(vec.begin(), vec.end(), [min_to_max](const T a, const T b) {
return (min_to_max == true) ? (a < b) : (b < a);
});
return vec;
}
template <typename T> void v1show(vector<T> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
cout << endl;
}
template <typename T> vector<vector<T>> v2init(int y_len, int x_len) {
vector<vector<T>> vec(y_len, vector<T>(x_len, 0));
return vec;
}
template <typename T>
vector<vector<T>> v2sort(vector<vector<T>> vec, int index) {
sort(vec.begin(), vec.end(), [index](const vector<T> a, const vector<T> b) {
return (a[index] > b[index]);
});
return vec;
}
template <typename T> void v2show(vector<vector<T>> vec) {
for (int i = 0; i < vec.size(); i++) {
for (int j = 0; j < vec[0].size(); j++) {
cout << vec[i][j] << " ";
}
cout << endl;
}
}
int main() {
int N, M;
cin >> N >> M;
auto a = v1init<ll>(N);
rep(i, N) { cin >> a[i]; }
auto vec = v2init<ll>(M, 2);
rep(i, M) { cin >> vec[i][0] >> vec[i][1]; }
vec = v2sort(vec, 1);
a = v1sort(a, false);
ll tmpmax = 0;
ll tmpnum = 0;
ll ans = 0;
int is_end = 0;
rep(i, M) {
rep(j, vec[i][0]) {
if (a[tmpmax] < vec[i][1] || tmpmax >= N) {
tmpnum++;
ans += vec[i][1];
} else {
tmpnum++;
ans += a[tmpmax];
tmpmax++;
j--;
}
// cout << ans << " " << tmpnum << " " << tmpmax << endl;
if (tmpnum == N) {
is_end = 1;
break;
}
}
if (is_end == 1) {
break;
}
}
for (int i = tmpnum; i < N; i++) {
ans += a[tmpmax];
tmpmax++;
}
cout << ans << endl;
return 0;
} | [
"expression.unary.arithmetic.add"
] | 853,433 | 853,434 | u923238225 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> a(n), b(m), c(m);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < m; i++) {
cin >> b.at(i) >> c.at(i);
}
sort(a.begin(), a.end());
vector<pair<long long, long long>> bc(m);
for (int i = 0; i < m; i++) {
bc.at(i) = make_pair(b.at(i), c.at(i));
}
sort(bc.begin(), bc.end());
for (int i = 0; i < m; i++) {
b.at(i) = bc.at(i).first;
c.at(i) = bc.at(i).second;
}
vector<long long> d(n);
int x = 0;
for (int i = m - 1; i >= 0; i--) {
for (int j = 0; j < b.at(i); j++) {
d.at(x) = c.at(i);
x++;
if (x == n) {
break;
}
}
if (x == n) {
break;
}
}
sort(d.begin(), d.end());
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a.at(a.size() - 1) > d.at(d.size() - 1)) {
ans += a.at(a.size() - 1);
if (a.size() == 1) {
a.at(0) = 0;
} else {
a.pop_back();
}
} else {
ans += d.at(d.size() - 1);
if (d.size() == 1) {
d.at(0) = 0;
} else {
d.pop_back();
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> a(n), b(m), c(m);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < m; i++) {
cin >> b.at(i) >> c.at(i);
}
sort(a.begin(), a.end());
vector<pair<long long, long long>> bc(m);
for (int i = 0; i < m; i++) {
bc.at(i) = make_pair(c.at(i), b.at(i));
}
sort(bc.begin(), bc.end());
for (int i = 0; i < m; i++) {
b.at(i) = bc.at(i).second;
c.at(i) = bc.at(i).first;
}
vector<long long> d(n);
int x = 0;
for (int i = m - 1; i >= 0; i--) {
for (int j = 0; j < b.at(i); j++) {
d.at(x) = c.at(i);
x++;
if (x == n) {
break;
}
}
if (x == n) {
break;
}
}
sort(d.begin(), d.end());
long long ans = 0;
for (int i = 0; i < n; i++) {
if (a.at(a.size() - 1) > d.at(d.size() - 1)) {
ans += a.at(a.size() - 1);
if (a.size() == 1) {
a.at(0) = 0;
} else {
a.pop_back();
}
} else {
ans += d.at(d.size() - 1);
if (d.size() == 1) {
d.at(0) = 0;
} else {
d.pop_back();
}
}
}
cout << ans << endl;
} | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 853,435 | 853,436 | u639024786 | cpp |
p03038 | #include <bits/stdc++.h>
#define INF 1e+18
#define ll long long
using namespace std;
signed main() {
int n, m, ans = 0, sum = 0;
map<int, int> mp;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
mp[b] += a;
}
for (auto it = mp.rbegin(); it != mp.rend(); it++) {
int num = min(n - sum, (*it).second);
sum += num;
ans += num * (*it).first;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define INF 1e+18
#define int long long
using namespace std;
signed main() {
int n, m, ans = 0, sum = 0;
map<int, int> mp;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
mp[b] += a;
}
for (auto it = mp.rbegin(); it != mp.rend(); it++) {
int num = min(n - sum, (*it).second);
sum += num;
ans += num * (*it).first;
}
cout << ans << endl;
} | [
"identifier.change"
] | 853,439 | 853,440 | u456611841 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int aux;
cin >> aux;
mp[aux]++;
}
for (int i = 0; i < m; i++) {
int B, C;
cin >> B >> C;
mp[C] += B;
}
int picked = 0;
long long int sum = 0;
for (auto i = mp.rbegin(); i != mp.rend(); i++) {
sum += i->first * min(i->second, n - picked);
picked += min(i->second, n - picked);
}
cout << sum;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int aux;
cin >> aux;
mp[aux]++;
}
for (int i = 0; i < m; i++) {
int B, C;
cin >> B >> C;
mp[C] += B;
}
int picked = 0;
long long int sum = 0;
for (auto i = mp.rbegin(); i != mp.rend(); i++) {
sum += (long long)i->first * min(i->second, n - picked);
picked += min(i->second, n - picked);
}
cout << sum;
} | [
"type_conversion.add"
] | 853,449 | 853,450 | u027395921 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int aux;
cin >> aux;
mp[aux]++;
}
for (int i = 0; i < m; i++) {
int B, C;
cin >> B >> C;
mp[C] += B;
}
int picked = 0;
int sum = 0;
for (auto i = mp.rbegin(); i != mp.rend(); i++) {
sum += i->first * min(i->second, n - picked);
picked += min(i->second, n - picked);
}
cout << sum;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int aux;
cin >> aux;
mp[aux]++;
}
for (int i = 0; i < m; i++) {
int B, C;
cin >> B >> C;
mp[C] += B;
}
int picked = 0;
long long int sum = 0;
for (auto i = mp.rbegin(); i != mp.rend(); i++) {
sum += (long long)i->first * min(i->second, n - picked);
picked += min(i->second, n - picked);
}
cout << sum;
} | [
"variable_declaration.type.widen.change",
"type_conversion.add"
] | 853,451 | 853,450 | u027395921 | cpp |
p03038 | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
int N, M, ans = 0;
cin >> N >> M;
vector<int> A(N);
vector<pair<int, int>> bc(M);
rep(i, N) cin >> A[i];
rep(i, M) cin >> bc[i].second >> bc[i].first;
sort(bc.begin(), bc.end());
reverse(bc.begin(), bc.end());
int i = 0, m = 0;
while (i < N) {
for (int j = 0; j < bc[m].second; j++) {
A.push_back(bc[m].first);
i++;
if (i == N)
break;
}
m++;
if (m == M)
break;
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
rep(i, N) ans += A[i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const long long INF = 1LL << 60;
int main(void) {
ll N, M, ans = 0;
cin >> N >> M;
vector<int> A(N);
vector<pair<int, int>> bc(M);
rep(i, N) cin >> A[i];
rep(i, M) cin >> bc[i].second >> bc[i].first;
sort(bc.begin(), bc.end());
reverse(bc.begin(), bc.end());
int i = 0, m = 0;
while (i < N) {
for (int j = 0; j < bc[m].second; j++) {
A.push_back(bc[m].first);
i++;
if (i == N)
break;
}
m++;
if (m == M)
break;
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
rep(i, N) ans += A[i];
cout << ans << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 853,462 | 853,463 | u895536055 | cpp |
p03038 | #include <bits/stdc++.h> //C++の標準ライブラリを一行で一括でインクルードする
#include <math.h> //数学関数と数学定数を利用する
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
int gcd(int a, int b) { //ユークリッドの互除法
if (a < b)
gcd(b, a); // aの方がbよりでかいのが前提
if (b == 0)
return a; // aをbで割り切れたらreturn
else
gcd(b, a % b);
}
int main() {
int n, m;
cin >> n >> m;
map<int, int, greater<int>> mp;
rep(i, n) {
int a;
cin >> a;
mp[a]++;
}
rep(i, m) {
int b, c;
cin >> b >> c;
mp[c] += b;
}
ll ans = 0;
ll cnt = 0;
for (auto m : mp) {
// printf("%d -> %d\n",m.first, m.second);
if (cnt + m.second > n) {
ans += m.first * (n - cnt);
break;
} else {
ans += m.first * m.second;
cnt += m.second;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h> //C++の標準ライブラリを一行で一括でインクルードする
#include <math.h> //数学関数と数学定数を利用する
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
int gcd(int a, int b) { //ユークリッドの互除法
if (a < b)
gcd(b, a); // aの方がbよりでかいのが前提
if (b == 0)
return a; // aをbで割り切れたらreturn
else
gcd(b, a % b);
}
int main() {
ll n, m;
cin >> n >> m;
map<ll, ll, greater<ll>> mp;
rep(i, n) {
ll a;
cin >> a;
mp[a]++;
}
rep(i, m) {
ll b, c;
cin >> b >> c;
mp[c] += b;
}
ll ans = 0;
ll cnt = 0;
for (auto m : mp) {
// printf("%d -> %d\n",m.first, m.second);
if (cnt + m.second > n) {
ans += m.first * (n - cnt);
break;
} else {
ans += m.first * m.second;
cnt += m.second;
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change"
] | 853,482 | 853,483 | u014967455 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
bool pairCompare(const pair<int, int> &x, const pair<int, int> &y) {
return x.second > y.second;
}
int main() {
int N, M;
cin >> N >> M;
int A[N];
rep(i, N) cin >> A[i];
sort(A, A + N);
vector<pair<int, int>> num(M);
rep(i, M) {
int B, C;
cin >> B >> C;
num[i] = make_pair(B, C);
}
sort(num.begin(), num.end(), pairCompare);
int ap = 0;
rep(i, M) {
bool flg = true;
int count = num[i].first;
while (count) {
if (A[ap] < num[i].second) {
A[ap] = num[i].second;
count--;
}
ap++;
if (ap == N) {
flg = false;
break;
}
if (!flg)
break;
}
}
// rep(i,N) cout << A[i] << endl;
ll result = 0;
rep(i, N) result += A[i];
cout << result << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
typedef long long ll;
const ll LLINF = 9223372036854775807;
const int INF = pow(2, 29);
const int MOD = 1000000007;
bool pairCompare(const pair<int, int> &x, const pair<int, int> &y) {
return x.second > y.second;
}
int main() {
int N, M;
cin >> N >> M;
ll A[N];
rep(i, N) cin >> A[i];
sort(A, A + N);
vector<pair<int, int>> num(M);
rep(i, M) {
int B, C;
cin >> B >> C;
num[i] = make_pair(B, C);
}
sort(num.begin(), num.end(), pairCompare);
int ap = 0;
rep(i, M) {
bool flg = true;
int count = num[i].first;
while (count) {
if (A[ap] < num[i].second) {
A[ap] = num[i].second;
count--;
}
ap++;
if (ap == N) {
flg = false;
break;
}
}
if (!flg)
break;
}
// rep(i,N) cout << A[i] << endl;
ll result = 0;
rep(i, N) result += A[i];
cout << result << endl;
return 0;
} | [
"variable_declaration.type.change"
] | 853,486 | 853,485 | u680707192 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
priority_queue<pair<int, int>> Q;
rep(i, n) {
int a;
scanf("%d", &a);
Q.emplace(-a, 1);
}
rep(_, m) {
int b, c;
scanf("%d%d", &b, &c);
int b0 = b;
while (1) {
auto x = Q.top();
int val = -x.first, num = x.second;
if (c <= val) {
if (b < b0)
Q.emplace(-val, b0 - b);
break;
}
if (b <= num) {
Q.pop();
if (b < num)
Q.emplace(-val, num - b);
Q.emplace(-c, b0);
break;
} else {
Q.pop();
b -= num;
}
}
}
long long ans = 0;
while (!Q.empty()) {
auto x = Q.top();
int val = -x.first, num = x.second;
ans += 1LL * val * num;
Q.pop();
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
priority_queue<pair<int, int>> Q;
rep(i, n) {
int a;
scanf("%d", &a);
Q.emplace(-a, 1);
}
rep(_, m) {
int b, c;
scanf("%d%d", &b, &c);
int b0 = b;
while (1) {
auto x = Q.top();
int val = -x.first, num = x.second;
if (c <= val) {
if (b < b0)
Q.emplace(-c, b0 - b);
break;
}
if (b <= num) {
Q.pop();
if (b < num)
Q.emplace(-val, num - b);
Q.emplace(-c, b0);
break;
} else {
Q.pop();
b -= num;
}
}
}
long long ans = 0;
while (!Q.empty()) {
auto x = Q.top();
int val = -x.first, num = x.second;
ans += 1LL * val * num;
Q.pop();
}
printf("%lld\n", ans);
return 0;
}
| [
"identifier.change",
"call.arguments.change"
] | 853,487 | 853,488 | u781095600 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define MOD (1000000007)
// 127
struct IntPair {
LL B, C;
};
int main() {
LL N, M;
scanf("%lld %lld", &N, &M);
vector<LL> A;
for (int i = 0; i < N; i++) {
LL val;
scanf("%lld", &val);
A.push_back(val);
}
vector<IntPair> P;
for (int i = 0; i < M; i++) {
LL val1, val2;
scanf("%lld %lld", &val1, &val2);
IntPair pair;
pair.B = val1;
pair.C = val2;
P.push_back(pair);
}
std::sort(A.begin(), A.end());
std::sort(P.begin(), P.end(),
[](const IntPair &a, const IntPair &b) { return a.C > b.C; });
LL indexA = 0;
bool finish = false;
for (auto item : P) {
for (int i = 0; i < item.B; i++) {
if (item.C > A[indexA]) {
A[indexA] = item.C;
} else {
finish = true;
break;
}
indexA++;
if (indexA >= N - 1) {
finish = true;
break;
}
}
if (finish) {
break;
}
}
LL result = 0;
for (auto item : A) {
result += item;
}
printf("%lld\n", result);
return 0;
}
// 126
/*
struct Node {
unsigned int connect;
unsigned int weight;
};
int main() {
LL N;
scanf("%lld", &N);
static vector<Node> node[100010];
static char color[100010];
for (int i = 0; i < N - 1; i++) {
unsigned int u, v, w;
scanf("%d %d %d", &u, &v, &w);
Node n1;
n1.connect = v;
n1.weight = w;
node[u].push_back(n1);
Node n2;
n2.connect = u;
n2.weight = w;
node[v].push_back(n2);
}
for (int i = 0; i <= N; i++) {
color[i] = -1;
}
std::queue<unsigned int> q;
color[1] = 0;
q.push(1);
//���D��T��
while (q.size() > 0) {
unsigned int index = q.front();
q.pop();
char c = color[index];
for (auto item : node[index]) {
if (color[item.connect] < 0) {
//�܂��ʂ��Ă��Ȃ��m�[�h
color[item.connect] = item.weight % 2 == 0 ? c :
1 - c; q.push(item.connect);
}
}
}
for (int i = 1; i <= N; i++) {
printf("%d\n", color[i]);
}
return 0;
}
*/ | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define LL long long
#define MOD (1000000007)
// 127
struct IntPair {
LL B, C;
};
int main() {
LL N, M;
scanf("%lld %lld", &N, &M);
vector<LL> A;
for (int i = 0; i < N; i++) {
LL val;
scanf("%lld", &val);
A.push_back(val);
}
vector<IntPair> P;
for (int i = 0; i < M; i++) {
LL val1, val2;
scanf("%lld %lld", &val1, &val2);
IntPair pair;
pair.B = val1;
pair.C = val2;
P.push_back(pair);
}
std::sort(A.begin(), A.end());
std::sort(P.begin(), P.end(),
[](const IntPair &a, const IntPair &b) { return a.C > b.C; });
LL indexA = 0;
bool finish = false;
for (auto item : P) {
for (int i = 0; i < item.B; i++) {
if (item.C > A[indexA]) {
A[indexA] = item.C;
} else {
finish = true;
break;
}
indexA++;
if (indexA >= N) {
finish = true;
break;
}
}
if (finish) {
break;
}
}
LL result = 0;
for (auto item : A) {
result += item;
}
printf("%lld\n", result);
return 0;
}
// 126
/*
struct Node {
unsigned int connect;
unsigned int weight;
};
int main() {
LL N;
scanf("%lld", &N);
static vector<Node> node[100010];
static char color[100010];
for (int i = 0; i < N - 1; i++) {
unsigned int u, v, w;
scanf("%d %d %d", &u, &v, &w);
Node n1;
n1.connect = v;
n1.weight = w;
node[u].push_back(n1);
Node n2;
n2.connect = u;
n2.weight = w;
node[v].push_back(n2);
}
for (int i = 0; i <= N; i++) {
color[i] = -1;
}
std::queue<unsigned int> q;
color[1] = 0;
q.push(1);
//���D��T��
while (q.size() > 0) {
unsigned int index = q.front();
q.pop();
char c = color[index];
for (auto item : node[index]) {
if (color[item.connect] < 0) {
//�܂��ʂ��Ă��Ȃ��m�[�h
color[item.connect] = item.weight % 2 == 0 ? c :
1 - c; q.push(item.connect);
}
}
}
for (int i = 1; i <= N; i++) {
printf("%d\n", color[i]);
}
return 0;
}
*/ | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 853,493 | 853,494 | u572472538 | cpp |
p03038 | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<ll> a(N), c(M), d(N);
vector<int> b(M);
vector<pair<int, int>> pairs(M);
ll sum = 0;
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
ans = sum;
for (int i = 0; i < M; i++) {
cin >> b[i] >> c[i];
pairs[i] = make_pair(c[i], b[i]);
}
sort(a.begin(), a.end());
sort(pairs.begin(), pairs.end(), greater<pair<int, int>>());
int j = 0;
for (int i = 0; i < N; i++) {
if (pairs[j].second == 0)
j++;
d[i] = pairs[j].first;
pairs[j].second--;
}
for (int i = 0; i < N; i++) {
sum = sum + d[i] - a[i];
if (sum > ans)
ans = sum;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define MOD 1000000007
typedef long long int ll;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<ll> a(N), c(M), d(N);
vector<int> b(M);
vector<pair<ll, int>> pairs(M);
ll sum = 0;
ll ans = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
sum += a[i];
}
ans = sum;
for (int i = 0; i < M; i++) {
cin >> b[i] >> c[i];
pairs[i] = make_pair(c[i], b[i]);
}
sort(a.begin(), a.end());
sort(pairs.begin(), pairs.end(), greater<pair<int, int>>());
int j = 0;
for (int i = 0; i < N; i++) {
if (pairs[j].second == 0)
j++;
d[i] = pairs[j].first;
pairs[j].second--;
}
for (int i = 0; i < N; i++) {
sum = sum + d[i] - a[i];
if (sum > ans)
ans = sum;
}
cout << ans << endl;
return 0;
} | [] | 853,514 | 853,515 | u942714396 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
ll mod = 1000000007;
/*
N+sum(B)個ののカードをソートして大きいものN個をとる
*/
void solve() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> v;
rep(i, n) {
int a;
cin >> a;
v.emplace_back(make_pair(-a, 1));
}
rep(i, m) {
int b, c;
cin >> b >> c;
v.emplace_back(make_pair(-c, b));
}
sort(v.begin(), v.end());
ll number = 0;
ll sum = 0;
ll i = 0;
while (number < n) {
ll f = -v[i].first;
ll s = v[i].second;
// cout << "f:" << f << " s:" << s << endl;
/*
nとnumberとの差がfより大きければ全部足す
そうでなければ
*/
sum += min(n - number, s) * f;
number += s;
}
cout << sum << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
typedef long long ll;
ll mod = 1000000007;
/*
N+sum(B)個ののカードをソートして大きいものN個をとる
*/
void solve() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> v;
rep(i, n) {
int a;
cin >> a;
v.emplace_back(make_pair(-a, 1));
}
rep(i, m) {
int b, c;
cin >> b >> c;
v.emplace_back(make_pair(-c, b));
}
sort(v.begin(), v.end());
ll number = 0;
ll sum = 0;
ll i = 0;
while (number < n) {
ll f = -v[i].first;
ll s = v[i].second;
// cout << "f:" << f << " s:" << s << endl;
/*
nとnumberとの差がfより大きければ全部足す
そうでなければ
*/
sum += min(n - number, s) * f;
number += s;
i++;
}
cout << sum << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
} | [
"expression.unary.arithmetic.add"
] | 853,524 | 853,525 | u272496669 | cpp |
p03038 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vii;
typedef vector<char> vc;
typedef vector<vc> vcc;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define in insert
#define sz(v) v.size()
#define mina(a, b) (a) = min((a), (b));
#define maxa(a, b) (a) = max((a), (b));
const int INF = 1e9 + 5;
void solve() {
int n, m;
cin >> n >> m;
vll v(n);
vii oper(m);
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
oper[i] = {(ll)b, a};
}
sort(all(v));
sort(rall(oper));
int cur = 0;
for (int i = 0; i < m; i++) {
// cout<<oper[i].S;
int curr = cur;
for (int j = curr; j < curr + oper[i].S; j++) {
// cout<<"/"<<j<<"/"<<endl;
if (v[j] < oper[i].F) {
// cout<<v[j]<<"->"<<oper[i].F<<endl;
v[j] = oper[i].F;
cur++;
} else
break;
}
}
ll sum = 0;
for (ll i : v)
sum += i;
cout << sum;
}
int main() {
int T = 1;
// cin>>T;
for (int i = 0; i < T; i++)
solve();
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef map<char, int> mci;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vii;
typedef vector<char> vc;
typedef vector<vc> vcc;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define in insert
#define sz(v) v.size()
#define mina(a, b) (a) = min((a), (b));
#define maxa(a, b) (a) = max((a), (b));
const int INF = 1e9 + 5;
void solve() {
int n, m;
cin >> n >> m;
vll v(n);
vii oper(m);
for (int i = 0; i < n; i++)
cin >> v[i];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
oper[i] = {(ll)b, a};
}
sort(all(v));
sort(rall(oper));
int cur = 0;
for (int i = 0; i < m; i++) {
// cout<<oper[i].S;
int curr = cur;
for (int j = curr; j < min(curr + oper[i].S, n); j++) {
// cout<<"/"<<j<<"/"<<endl;
if (v[j] < oper[i].F) {
// cout<<v[j]<<"->"<<oper[i].F<<endl;
v[j] = oper[i].F;
cur++;
} else
break;
}
}
ll sum = 0;
for (ll i : v)
sum += i;
cout << sum;
}
int main() {
int T = 1;
// cin>>T;
for (int i = 0; i < T; i++)
solve();
} | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 853,531 | 853,532 | u562206657 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main() {
int n, m;
cin >> n >> m;
vector<i64> v;
for (int i = 0; i < n; ++i) {
i64 a;
cin >> a;
v.push_back(a);
}
vector<pair<i64, i64>> op;
for (int i = 0; i < m; ++i) {
i64 b, c;
cin >> b >> c;
op.emplace_back(b, c);
}
sort(v.begin(), v.end());
sort(op.begin(), op.end(),
[](const pair<i64, i64> &a, const pair<i64, i64> &b) {
return a.second > b.second;
});
i64 ans = 0;
int idx = 0;
for (int i = 0; i < m; ++i) {
int cnt = 0;
for (int j = 0; j < op[i].first; ++j) {
if (idx + j > n)
break;
if (v[idx + j] > op[i].second)
break;
ans += op[i].second;
cnt++;
}
idx += cnt;
}
while (idx < n)
ans += v[idx++];
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
int main() {
int n, m;
cin >> n >> m;
vector<i64> v;
for (int i = 0; i < n; ++i) {
i64 a;
cin >> a;
v.push_back(a);
}
vector<pair<i64, i64>> op;
for (int i = 0; i < m; ++i) {
i64 b, c;
cin >> b >> c;
op.emplace_back(b, c);
}
sort(v.begin(), v.end());
sort(op.begin(), op.end(),
[](const pair<i64, i64> &a, const pair<i64, i64> &b) {
return a.second > b.second;
});
i64 ans = 0;
int idx = 0;
for (int i = 0; i < m; ++i) {
int cnt = 0;
for (int j = 0; j < op[i].first; ++j) {
if (idx + j >= n)
break;
if (v[idx + j] > op[i].second)
break;
ans += op[i].second;
cnt++;
}
idx += cnt;
}
while (idx < n)
ans += v[idx++];
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 853,538 | 853,539 | u823112986 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int n, m;
vector<ll> a, sum_a = {0}, sum_c = {0};
vector<LP> c = {LP(0, INF)};
void solve() {
cin >> n >> m;
a.resize(n, 0);
rep(i, n) { cin >> a[i]; }
rep(i, m) {
ll p, q;
cin >> p >> q;
c.push_back(LP(q, p));
}
sort(a.begin(), a.end());
sort(c.begin(), c.end(), greater<LP>());
int k = 0;
rep(i, n) {
sum_a.push_back(sum_a.back() + a[i]);
if (c[k].second != 0) {
sum_c.push_back(sum_c.back() + c[k].first);
c[k].second -= 1;
} else {
k += 1;
sum_c.push_back(sum_c.back() + c[k].first);
c[k].second -= 1;
}
// cout << a[i] << " " << c[k].first << endl;
// cout << sum_a[i] << " " <<sum_c[i] << endl;
}
ll ans = 0;
rep(i, n) { ans = max(ans, sum_a[n] - sum_a[i] + sum_c[i]); }
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
} | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int n, m;
vector<ll> a, sum_a = {0}, sum_c = {0};
vector<LP> c = {LP(0, INF)};
void solve() {
cin >> n >> m;
a.resize(n, 0);
rep(i, n) { cin >> a[i]; }
rep(i, m) {
ll p, q;
cin >> p >> q;
c.push_back(LP(q, p));
}
sort(a.begin(), a.end());
sort(c.begin(), c.end(), greater<LP>());
int k = 0;
rep(i, n) {
sum_a.push_back(sum_a.back() + a[i]);
if (c[k].second != 0) {
sum_c.push_back(sum_c.back() + c[k].first);
c[k].second -= 1;
} else {
k += 1;
sum_c.push_back(sum_c.back() + c[k].first);
c[k].second -= 1;
}
// cout << a[i] << " " << c[k].first << endl;
// cout << sum_a[i] << " " <<sum_c[i] << endl;
}
ll ans = 0;
rep(i, n + 1) { ans = max(ans, sum_a[n] - sum_a[i] + sum_c[i]); }
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
} | [
"expression.operation.binary.add"
] | 853,548 | 853,549 | u236127431 | cpp |
p03038 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
const ll MOD = 1000000007;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* (๑╹ここにすきなもじをいれてね！╹) */
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
///////////////////////////////////////////////
/* (๑╹最強╹) */
int main() {
ll N, M, c, b, m, ans;
m = 0;
cin >> N >> M;
ans = 0;
vector<ll> vec(N);
rep(i, N) { cin >> vec.at(i); }
vector<pair<ll, ll>> cb;
rep(i, M) {
cin >> b >> c;
cb.PB(MP(c, b));
}
sort(cb.rbegin(), cb.rend());
rep(i, M) {
rep(j, cb.at(i).second) { vec.push_back(cb.at(i).first); }
m += cb.at(i).second;
if (m > M)
break;
}
sort(vec.rbegin(), vec.rend());
rep(i, N) { ans += vec.at(i); }
cout << ans << endl;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
const ll MOD = 1000000007;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* (๑╹ここにすきなもじをいれてね！╹) */
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
///////////////////////////////////////////////
/* (๑╹最強╹) */
int main() {
ll N, M, c, b, m, ans;
m = 0;
cin >> N >> M;
ans = 0;
vector<ll> vec(N);
rep(i, N) { cin >> vec.at(i); }
vector<pair<ll, ll>> cb;
rep(i, M) {
cin >> b >> c;
cb.PB(MP(c, b));
}
sort(cb.rbegin(), cb.rend());
rep(i, M) {
rep(j, cb.at(i).second) { vec.push_back(cb.at(i).first); }
m += cb.at(i).second;
if (m > N)
break;
}
sort(vec.rbegin(), vec.rend());
rep(i, N) { ans += vec.at(i); }
cout << ans << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 853,559 | 853,560 | u532894762 | cpp |
p03038 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
const ll MOD = 1000000007;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* (๑╹ここにすきなもじをいれてね！╹) */
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
///////////////////////////////////////////////
/* (๑╹最強╹) */
int main() {
ll N, M, c, b, m, ans;
m = 0;
cin >> N >> M;
ans = 0;
vector<ll> vec(N);
rep(i, N) { cin >> vec.at(i); }
vector<pair<ll, ll>> cb;
rep(i, M) {
cin >> b >> c;
cb.PB(MP(c, b));
}
sort(cb.rbegin(), cb.rend());
rep(i, M) {
rep(j, cb.at(i).second) { vec.push_back(cb.at(i).first); }
m += cb.at(i).second;
if (m < M)
break;
}
sort(vec.rbegin(), vec.rend());
rep(i, N) { ans += vec.at(i); }
cout << ans << endl;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define MP make_pair
#define DEBUG printf("%s\n", "debug")
#define fst first
#define snd second
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
///////////////////////////////////////////////
/* (๑╹◡╹) */
const ll MOD = 1000000007;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* (๑╹ここにすきなもじをいれてね！╹) */
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
///////////////////////////////////////////////
/* (๑╹最強╹) */
int main() {
ll N, M, c, b, m, ans;
m = 0;
cin >> N >> M;
ans = 0;
vector<ll> vec(N);
rep(i, N) { cin >> vec.at(i); }
vector<pair<ll, ll>> cb;
rep(i, M) {
cin >> b >> c;
cb.PB(MP(c, b));
}
sort(cb.rbegin(), cb.rend());
rep(i, M) {
rep(j, cb.at(i).second) { vec.push_back(cb.at(i).first); }
m += cb.at(i).second;
if (m > N)
break;
}
sort(vec.rbegin(), vec.rend());
rep(i, N) { ans += vec.at(i); }
cout << ans << endl;
} | [] | 853,561 | 853,560 | u532894762 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
vector<pair<int, int>> B_C(M);
for (int i = 0; i < N; i++)
cin >> A.at(i);
for (int i = 0; i < M; i++) {
cin >> B_C.at(i).first >> B_C.at(i).second;
}
sort(B_C.begin(), B_C.end(), greater<pair<int, int>>());
vector<int> C_list(0);
for (int i = 0; i < M; i++) {
for (int j = 0; j < B_C.at(i).first; j++) {
C_list.push_back(B_C.at(i).second);
if (C_list.size() == N)
break;
}
if (C_list.size() == N)
break;
}
sort(A.begin(), A.end());
sort(C_list.begin(), C_list.end(), greater<int>());
for (int i = 0; i < C_list.size(); i++) {
if (A.at(i) < C_list.at(i))
A.at(i) = C_list.at(i);
}
long sum = 0;
for (int i = 0; i < N; i++) {
sum += A.at(i);
}
cout << sum << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
vector<pair<int, int>> B_C(M);
for (int i = 0; i < N; i++)
cin >> A.at(i);
for (int i = 0; i < M; i++) {
cin >> B_C.at(i).second >> B_C.at(i).first;
}
sort(B_C.begin(), B_C.end(), greater<pair<int, int>>());
vector<int> C_list(0);
for (int i = 0; i < M; i++) {
for (int j = 0; j < B_C.at(i).second; j++) {
C_list.push_back(B_C.at(i).first);
if (C_list.size() == N)
break;
}
if (C_list.size() == N)
break;
}
sort(A.begin(), A.end());
sort(C_list.begin(), C_list.end(), greater<int>());
for (int i = 0; i < C_list.size(); i++) {
if (A.at(i) < C_list.at(i))
A.at(i) = C_list.at(i);
}
long sum = 0;
for (int i = 0; i < N; i++) {
sum += A.at(i);
}
cout << sum << endl;
} | [
"expression.operation.binary.change",
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 853,562 | 853,563 | u091454649 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<int> A(N), B(M), C(M);
for (int i = 0; i < N; ++i)
std::cin >> A[i];
for (int i = 0; i < M; ++i)
std::cin >> B[i] >> C[i];
std::vector<std::pair<int, int>> vec(N + M);
for (int i = 0; i < N; ++i) {
vec[i].first = A[i];
vec[i].second = 1;
}
for (int i = 0; i < M; ++i) {
vec[N + i].first = C[i];
vec[N + i].second = B[i];
}
typedef std::pair<int, int> P;
sort(vec.begin(), vec.end(), [](const P &p1, const P &p2) {
if (p1.first > p2.first)
return true;
if (p1.first == p2.first)
return p1.second > p2.second;
return false;
});
/* for(int i=0; i<M; ++i) {
for(int j=0; j<B[i]; j++){
A.push_back(C[i]);
}
}*/
// std::sort(A.begin(), A.end(), std::greater<int>() );
long int ans = 0;
int i = 0, count = 0;
while (count < N) {
if (count + vec[i].second < N) {
ans += vec[i].first * vec[i].second;
count += vec[i].second;
} else {
ans += vec[i].first * (N - count);
count += vec[i].second;
}
i++;
}
std::cout << ans << std::endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<long int> A(N), B(M), C(M);
for (int i = 0; i < N; ++i)
std::cin >> A[i];
for (int i = 0; i < M; ++i)
std::cin >> B[i] >> C[i];
std::vector<std::pair<long int, long int>> vec(N + M);
for (int i = 0; i < N; ++i) {
vec[i].first = A[i];
vec[i].second = 1;
}
for (int i = 0; i < M; ++i) {
vec[N + i].first = C[i];
vec[N + i].second = B[i];
}
typedef std::pair<long int, long int> P;
sort(vec.begin(), vec.end(), [](const P &p1, const P &p2) {
if (p1.first > p2.first)
return true;
if (p1.first == p2.first)
return p1.second > p2.second;
return false;
});
/* for(int i=0; i<M; ++i) {
for(int j=0; j<B[i]; j++){
A.push_back(C[i]);
}
}*/
// std::sort(A.begin(), A.end(), std::greater<int>() );
long int ans = 0;
int i = 0, count = 0;
while (count < N) {
if (count + vec[i].second < N) {
ans += vec[i].first * vec[i].second;
count += vec[i].second;
} else {
ans += vec[i].first * (N - count);
count += vec[i].second;
}
i++;
}
std::cout << ans << std::endl;
return 0;
} | [
"variable_declaration.type.widen.change"
] | 853,576 | 853,577 | u936600428 | cpp |
p03038 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
long long sum = 0;
cin >> n >> m;
int a[n];
pair<int, int> b[m];
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < m; i++) {
scanf("%d %d", &b[i].second, &b[i].first);
}
sort(a, a + n);
sort(b, b + m, greater<pair<int, int>>());
for (int i = 0, j = 0; i < n; i++) {
if (a[i] < b[j].first && b[j].second > 0) {
a[i] = b[j].first;
--b[j].second;
}
j += (b[j].second == 0);
sum += a[i];
}
printf("%lld", sum);
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
long long sum = 0;
cin >> n >> m;
int a[n];
pair<int, int> b[m];
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
for (int i = 0; i < m; i++) {
scanf("%d %d", &b[i].second, &b[i].first);
}
sort(a, a + n);
sort(b, b + m, greater<pair<int, int>>());
for (int i = 0, j = 0; i < n; i++) {
if (a[i] < b[j].first && b[j].second > 0) {
a[i] = b[j].first;
--b[j].second;
}
j += (b[j].second == 0 && j < m - 1);
sum += a[i];
}
printf("%lld", sum);
return 0;
}
| [
"assignment.change"
] | 853,578 | 853,579 | u625436307 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
ll N, M;
cin >> N >> M;
vector<pll> A;
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
A.push_back({a, 1});
}
for (int i = 0; i < M; i++) {
ll b, c;
cin >> b >> c;
A.push_back({c, b});
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int total = 0;
ll cnt = 0;
for (auto &x : A) {
ll addcnt = min(x.second, N - cnt);
total += x.first * addcnt;
cnt += addcnt;
if (cnt >= N)
break;
}
cout << total << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
ll N, M;
cin >> N >> M;
vector<pll> A;
for (ll i = 0; i < N; i++) {
ll a;
cin >> a;
A.push_back({a, 1});
}
for (ll i = 0; i < M; i++) {
ll b, c;
cin >> b >> c;
A.push_back({c, b});
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
ll total = 0;
ll cnt = 0;
for (auto &x : A) {
ll addcnt = min(x.second, N - cnt);
total += x.first * addcnt;
cnt += addcnt;
if (cnt >= N)
break;
}
cout << total << endl;
return 0;
}
| [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 853,589 | 853,590 | u194385557 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<std::pair<int, int>> cards;
int n, m;
std::cin >> n >> m;
for (int i = 0; i < n; i++) {
int tmp;
std::cin >> tmp;
cards.push_back(std::pair<int, int>(tmp, 1));
}
for (int i = 0; i < m; i++) {
int b, c;
std::cin >> b >> c;
cards.push_back(std::pair<int, int>(c, b));
}
std::sort(cards.begin(), cards.end());
std::reverse(cards.begin(), cards.end());
long sum = 0;
for (int i = 0; i < n; i++) {
long number = cards[i].first;
long quantity = cards[i].second;
if (n <= quantity) {
sum += n * number;
break;
} else {
sum += quantity * number;
n -= quantity;
}
}
std::cout << sum << std::endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
std::vector<std::pair<int, int>> cards;
int n, m;
std::cin >> n >> m;
for (int i = 0; i < n; i++) {
int tmp;
std::cin >> tmp;
cards.push_back(std::pair<int, int>(tmp, 1));
}
for (int i = 0; i < m; i++) {
int b, c;
std::cin >> b >> c;
cards.push_back(std::pair<int, int>(c, b));
}
std::sort(cards.begin(), cards.end());
std::reverse(cards.begin(), cards.end());
long sum = 0;
for (int i = 0;; i++) {
long number = cards[i].first;
long quantity = cards[i].second;
if (n <= quantity) {
sum += n * number;
break;
} else {
sum += quantity * number;
n -= quantity;
}
}
std::cout << sum << std::endl;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 853,600 | 853,601 | u775347320 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int main() {
int N, M;
cin >> N >> M;
priority_queue<pair<int, int>> A;
for (int i = 0; i < N; ++i) {
int inp;
cin >> inp;
A.push(make_pair(inp, 1)); // Ai has one
}
for (int i = 0; i < M; ++i) {
int b, c;
cin >> b >> c;
A.push(make_pair(c, b));
}
int rtn = 0;
for (int i = 0; i < N; ++i) {
pair<int, int> p = A.top();
A.pop();
rtn += p.first;
p.second--;
if (p.second != 0)
A.push(p);
}
cout << rtn << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 999999999;
int main() {
int N, M;
cin >> N >> M;
priority_queue<pair<int, int>> A;
for (int i = 0; i < N; ++i) {
int inp;
cin >> inp;
A.push(make_pair(inp, 1)); // Ai has one
}
for (int i = 0; i < M; ++i) {
int b, c;
cin >> b >> c;
A.push(make_pair(c, b));
}
ll rtn = 0;
for (int i = 0; i < N; ++i) {
pair<int, int> p = A.top();
A.pop();
rtn += p.first;
p.second--;
if (p.second != 0)
A.push(p);
}
cout << rtn << endl;
} | [
"variable_declaration.type.change"
] | 853,605 | 853,606 | u239023686 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N, M, A[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> M;
rep(i, 0, N) cin >> A[i];
sort(A, A + N);
vector<pair<int, int>> v;
rep(i, 0, M) {
int B, C;
cin >> B >> C;
v.push_back({B, C});
}
sort(all(v), greater<pair<int, int>>());
int id = 0;
fore(p, v) {
rep(i, 0, p.second) {
if (id == N)
break;
if (A[id] < p.first) {
A[id] = p.first;
id++;
} else
break;
}
}
ll ans = 0;
rep(i, 0, N) ans += A[i];
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
typedef long long ll;
const int inf = INT_MAX / 2;
const ll infl = 1LL << 60;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N, M, A[101010];
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> M;
rep(i, 0, N) cin >> A[i];
sort(A, A + N);
vector<pair<int, int>> v;
rep(i, 0, M) {
int B, C;
cin >> B >> C;
v.push_back({C, B});
}
sort(all(v), greater<pair<int, int>>());
int id = 0;
fore(p, v) {
rep(i, 0, p.second) {
if (id == N)
break;
if (A[id] < p.first) {
A[id] = p.first;
id++;
} else
break;
}
}
ll ans = 0;
rep(i, 0, N) ans += A[i];
cout << ans << endl;
}
| [] | 853,612 | 853,613 | u141378465 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <iostream>
typedef struct _pair {
long long int B;
long long int C;
} pair;
bool comC(pair &a, pair &b) { return a.C < b.C; }
int main() {
long long int N, M, A[100000], newA[100000], result = 0;
pair data[100000];
std::cin >> N >> M;
for (int i = 0; i < N; i++)
std::cin >> A[i];
for (int i = 0; i < M; i++)
std::cin >> data[i].B >> data[i].C;
std::sort(A, A + N, std::greater<int>());
std::sort(data, data + M, comC);
int index = N - 1;
for (int i = M - 1; i >= 0; i--) {
for (int j = data[i].B; j > 0; j--) {
newA[index--] = data[i].C;
if (index == 0)
break;
}
if (index == 0)
break;
}
for (int i = 0; i < N; i++) {
result += std::max(A[i], newA[i]);
}
std::cout << result << std::endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
typedef struct _pair {
long long int B;
long long int C;
} pair;
bool comC(pair &a, pair &b) { return a.C < b.C; }
int main() {
long long int N, M, A[100000], newA[100000], result = 0;
pair data[100000];
std::cin >> N >> M;
for (int i = 0; i < N; i++)
std::cin >> A[i];
for (int i = 0; i < M; i++)
std::cin >> data[i].B >> data[i].C;
std::sort(A, A + N, std::greater<int>());
std::sort(data, data + M, comC);
int index = N - 1;
for (int i = M - 1; i >= 0; i--) {
for (int j = data[i].B; j > 0; j--) {
newA[index--] = data[i].C;
if (index < 0)
break;
}
if (index < 0)
break;
}
for (int i = 0; i < N; i++) {
result += std::max(A[i], newA[i]);
}
std::cout << result << std::endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 853,625 | 853,626 | u451529323 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int n, m, a[N], z;
pair<int, int> v[N];
long long int sum = 0;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
v[i] = make_pair(y, x);
}
sort(v, v + m);
reverse(v, v + m);
for (int i = 0; i < m; i++) {
int c = 0;
while (a[z] < v[i].first && c < v[i].second) {
z++;
c++;
}
sum += 1LL * c * v[i].first;
}
for (int i = z; i < n; i++)
sum += a[i];
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int n, m, a[N], z;
pair<int, int> v[N];
long long int sum = 0;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
v[i] = make_pair(y, x);
}
sort(v, v + m);
reverse(v, v + m);
for (int i = 0; i < m; i++) {
int c = 0;
while (a[z] < v[i].first && c < v[i].second && z < n) {
z++;
c++;
}
sum += 1LL * c * v[i].first;
}
for (int i = z; i < n; i++)
sum += a[i];
cout << sum;
return 0;
} | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 853,627 | 853,628 | u221592478 | cpp |
p03038 | #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m), c(m);
for (size_t i = 0; i < n; i++) {
cin >> a[i];
}
for (size_t i = 0; i < m; i++) {
cin >> b[i] >> c[i];
}
priority_queue<pair<int, int>> q;
for (size_t i = 0; i < n; i++) {
q.push(make_pair(a[i], 1));
}
for (size_t i = 0; i < m; i++) {
q.push(make_pair(c[i], b[i]));
}
int ans = 0;
for (size_t i = 0; i < n; i++) {
pair<int, int> p = q.top();
q.pop();
ans += p.first;
// cout << p.first << endl;
if (p.second > 1) {
// cout << "in: " << p.first << endl;
p.second -= 1;
q.push(p);
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n), b(m), c(m);
for (size_t i = 0; i < n; i++) {
cin >> a[i];
}
for (size_t i = 0; i < m; i++) {
cin >> b[i] >> c[i];
}
priority_queue<pair<int, int>> q;
for (size_t i = 0; i < n; i++) {
q.push(make_pair(a[i], 1));
}
for (size_t i = 0; i < m; i++) {
q.push(make_pair(c[i], b[i]));
}
long long ans = 0;
for (size_t i = 0; i < n; i++) {
pair<int, int> p = q.top();
q.pop();
ans += p.first;
// cout << p.first << endl;
if (p.second > 1) {
// cout << "in: " << p.first << endl;
p.second -= 1;
q.push(p);
}
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,640 | 853,641 | u432551953 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<pair<int, int>> cb(m);
vector<long long> d(n);
for (int i = 0; i < m; ++i) {
int b, c;
cin >> b >> c;
cb[i].first = c;
cb[i].second = b;
}
sort(cb.begin(), cb.end(), greater<pair<int, int>>());
sort(a.begin(), a.end());
int tmp = 0;
for (int i = 0; tmp < n && cb.size() > i; ++i) {
for (int j = 0; j < cb[i].second; ++j) {
d[tmp++] = cb[i].first;
}
}
long long ans = 0;
tmp = 0;
for (int i = 0; i < n; ++i) {
if (i <= d.size() && a[i] < d[tmp])
ans += d[tmp++];
else
ans += a[i];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<pair<int, int>> cb(m);
vector<long long> d(n);
for (int i = 0; i < m; ++i) {
int b, c;
cin >> b >> c;
cb[i].first = c;
cb[i].second = b;
}
sort(cb.begin(), cb.end(), greater<pair<int, int>>());
sort(a.begin(), a.end());
int tmp = 0;
for (int i = 0; tmp < n && cb.size() > i; ++i) {
for (int j = 0; j < cb[i].second; ++j) {
if (tmp < n)
d[tmp++] = cb[i].first;
}
}
long long ans = 0;
tmp = 0;
for (int i = 0; i < n; ++i) {
if (i <= d.size() && a[i] < d[tmp])
ans += d[tmp++];
else
ans += a[i];
}
cout << ans << endl;
return 0;
} | [
"control_flow.branch.if.add"
] | 853,648 | 853,647 | u848359007 | cpp |
p03038 | #include <bits/stdc++.h>
int n, m;
std::vector<int> vec, vec2;
std::vector<std::pair<int, int>> query;
int main() {
std::cin >> n >> m;
vec2.assign(n, 0);
for (int i = 0; i < n; i++) {
std::cin >> vec2[i];
}
query.assign(m, {0, 0});
for (int i = 0; i < m; i++) {
std::cin >> query[i].second >> query[i].first;
}
std::sort(vec2.begin(), vec2.end());
std::sort(query.begin(), query.end());
std::reverse(query.begin(), query.end());
auto f = vec2.begin();
for (int i = 0; i < m; i++) {
auto it = std::lower_bound(f, vec2.end(), query[i].first);
auto w = std::distance(f, it);
if (w == 0) {
break;
}
if (w > query[i].second) {
w = query[i].second;
}
for (int v = 0; v < w; v++) {
*(f + v) = query[i].first;
}
f = it;
}
long long r = 0;
for (int j = 0; j < n; j++) {
r += vec2[j];
}
std::cout << r << std::endl;
}
| #include <bits/stdc++.h>
int n, m;
std::vector<int> vec, vec2;
std::vector<std::pair<int, int>> query;
int main() {
std::cin >> n >> m;
vec2.assign(n, 0);
for (int i = 0; i < n; i++) {
std::cin >> vec2[i];
}
query.assign(m, {0, 0});
for (int i = 0; i < m; i++) {
std::cin >> query[i].second >> query[i].first;
}
std::sort(vec2.begin(), vec2.end());
std::sort(query.begin(), query.end());
std::reverse(query.begin(), query.end());
auto f = vec2.begin();
for (int i = 0; i < m; i++) {
auto it = std::lower_bound(f, vec2.end(), query[i].first);
auto w = std::distance(f, it);
if (w == 0) {
break;
}
if (w > query[i].second) {
w = query[i].second;
}
for (int v = 0; v < w; v++) {
*(f + v) = query[i].first;
}
f += w;
}
long long r = 0;
for (int j = 0; j < n; j++) {
r += vec2[j];
}
std::cout << r << std::endl;
}
| [
"assignment.change"
] | 853,654 | 853,655 | u537538698 | cpp |
p03038 | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------------------
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i > n; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, m) RFOR(i, m, 0)
// container util
//------------------------------------------
#define pb(a) push_back(a)
#define fst first
#define snd second
#define SORT(V) sort((V).begin(), (V).end())
#define REV(V) reverse((V).begin(), (V).end())
// constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// grobal variable
//------------------------------------------
// def function, class
//------------------------------------------
// main
//------------------------------------------
signed main() {
int N, M;
cin >> N >> M;
VI A(N);
VP CB(M);
REP(i, N) cin >> A.at(i);
REP(i, M) cin >> CB.at(i).snd >> CB.at(i).fst;
SORT(A);
SORT(CB);
REV(CB);
// REP(i, M) cout << CB.at(i).fst << " " << CB.at(i).snd << endl;
int now = 0;
REP(i, M) {
int cnt = 0;
REP(j, CB.at(i).snd) {
if (N < now + j)
break;
if (CB.at(i).fst > A.at(now + j)) {
A.at(now + j) = CB.at(i).fst;
cnt++;
} else {
break;
}
}
now += cnt;
}
int ans = 0;
REP(i, N) ans += A.at(i);
// REP(i, N) cout << A.at(i) << endl;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------------------
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i > n; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, m) RFOR(i, m, 0)
// container util
//------------------------------------------
#define pb(a) push_back(a)
#define fst first
#define snd second
#define SORT(V) sort((V).begin(), (V).end())
#define REV(V) reverse((V).begin(), (V).end())
// constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// grobal variable
//------------------------------------------
// def function, class
//------------------------------------------
// main
//------------------------------------------
signed main() {
int N, M;
cin >> N >> M;
VI A(N);
VP CB(M);
REP(i, N) cin >> A.at(i);
REP(i, M) cin >> CB.at(i).snd >> CB.at(i).fst;
SORT(A);
SORT(CB);
REV(CB);
// REP(i, M) cout << CB.at(i).fst << " " << CB.at(i).snd << endl;
int now = 0;
REP(i, M) {
int cnt = 0;
REP(j, CB.at(i).snd) {
if (N <= now + j)
break;
if (CB.at(i).fst > A.at(now + j)) {
A.at(now + j) = CB.at(i).fst;
cnt++;
} else {
break;
}
}
now += cnt;
}
int ans = 0;
REP(i, N) ans += A.at(i);
// REP(i, N) cout << A.at(i) << endl;
cout << ans << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 853,664 | 853,665 | u055131803 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
#include <iostream>
#define PII pair<ll, ll>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll n, n2, m;
ll ans;
ll a[100005];
PII b[100005];
int main() {
scanf("%lld%lld", &n, &m);
n2 = n;
for (ll i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
for (ll i = 0; i < m; i++) {
scanf("%lld%lld", &b[i].S, &b[i].F);
}
sort(a, a + n);
sort(b, b + m, greater<PII>());
a[n] = 2e9;
for (ll i = 0, j = 0; i < m; i++) {
while (b[i].S--) {
if (b[i].F > a[j])
a[j] = b[i].F;
else {
i = m;
break;
}
}
}
for (int i = 0; i < n; i++) {
ans += a[i];
}
printf("%lld", ans);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#define PII pair<ll, ll>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll n, n2, m;
ll ans;
ll a[100005];
PII b[100005];
int main() {
scanf("%lld%lld", &n, &m);
n2 = n;
for (ll i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
for (ll i = 0; i < m; i++) {
scanf("%lld%lld", &b[i].S, &b[i].F);
}
sort(a, a + n);
sort(b, b + m, greater<PII>());
a[n] = 2e9;
for (ll i = 0, j = 0; i < m; i++) {
while (b[i].S--) {
if (b[i].F > a[j])
a[j] = b[i].F;
else {
i = m;
break;
}
j++;
}
}
for (int i = 0; i < n; i++) {
ans += a[i];
}
printf("%lld", ans);
return 0;
}
| [
"expression.unary.arithmetic.add"
] | 853,668 | 853,669 | u307227472 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define For(i, n) for (long i = 0; i < (n); i++)
int main() {
long n, m, k = 0;
cin >> n >> m;
vector<long> A(n);
vector<pair<long, long>> BC(m);
vector<long> change;
For(i, n) { cin >> A.at(i); }
For(i, m) {
long b, c;
cin >> b >> c;
BC[i] = make_pair(c, b);
k += b;
}
sort(A.begin(), A.end());
sort(BC.begin(), BC.end()); // firstが数字 secondが個数
long t = 0;
long num = m - 1;
long kosuu = 0;
while (A.at(t) < BC[num].first) {
A.at(t) = BC[num].first;
t++;
kosuu++;
if (kosuu >= BC[num].second) {
num--;
kosuu = 0;
}
if (t >= k) {
break;
}
}
long ans = 0;
For(i, n) {
// cout<<A.at(i)<<endl;
ans += A.at(i);
}
cout << ans << endl;
// For(i,m){
// cout<<BC[i].first<<BC[i].second<<endl;
//}
}
| #include <bits/stdc++.h>
using namespace std;
#define For(i, n) for (long i = 0; i < (n); i++)
int main() {
long n, m, k = 0;
cin >> n >> m;
vector<long> A(n);
vector<pair<long, long>> BC(m);
vector<long> change;
For(i, n) { cin >> A.at(i); }
For(i, m) {
long b, c;
cin >> b >> c;
BC[i] = make_pair(c, b);
k += b;
}
sort(A.begin(), A.end());
sort(BC.begin(), BC.end()); // firstが数字 secondが個数
long t = 0;
long num = m - 1;
long kosuu = 0;
while (A.at(t) < BC[num].first) {
A.at(t) = BC[num].first;
t++;
kosuu++;
if (kosuu >= BC[num].second) {
num--;
kosuu = 0;
}
if (t >= k || t >= n) {
break;
}
}
long ans = 0;
For(i, n) {
// cout<<A.at(i)<<endl;
ans += A.at(i);
}
cout << ans << endl;
// For(i,m){
// cout<<BC[i].first<<BC[i].second<<endl;
//}
}
| [
"control_flow.branch.if.condition.change"
] | 853,687 | 853,688 | u813174766 | cpp |
p03038 | #include <algorithm>
#include <iostream>
using namespace std;
int a[100006];
struct lin {
int num;
int value;
};
lin b[100006];
bool cmp(lin a, lin b) { return a.value > b.value; }
int main() {
int n;
int m;
cin >> n >> m;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
b[i].num = x;
b[i].value = y;
}
sort(b, b + m, cmp);
long long j = 0;
long long k = 0;
for (int i = 0; i < m; i++) {
k = j + b[i].num;
for (j; j < k; j++) {
// cout<<"j="<<j<<" value="<<b[i].value<<" a[j]="<<a[j]<<endl;
if (a[j] >= b[i].value || j <= n) {
k = -1;
break;
}
sum = sum - a[j] + b[i].value;
}
if (k == -1)
break;
}
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int a[100006];
struct lin {
int num;
int value;
};
lin b[100006];
bool cmp(lin a, lin b) { return a.value > b.value; }
int main() {
int n;
int m;
cin >> n >> m;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
b[i].num = x;
b[i].value = y;
}
sort(b, b + m, cmp);
long long j = 0;
long long k = 0;
for (int i = 0; i < m; i++) {
k = j + b[i].num;
for (j; j < k; j++) {
// cout<<"j="<<j<<" value="<<b[i].value<<" a[j]="<<a[j]<<endl;
if (a[j] >= b[i].value || j >= n) {
k = -1;
break;
}
sum = sum - a[j] + b[i].value;
}
if (k == -1)
break;
}
cout << sum << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 853,691 | 853,692 | u359563380 | cpp |
p03038 | #include <algorithm>
#include <iostream>
using namespace std;
int a[100006];
struct lin {
int num;
int value;
};
lin b[100006];
bool cmp(lin a, lin b) { return a.value > b.value; }
int main() {
int n;
int m;
cin >> n >> m;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
b[i].num = x;
b[i].value = y;
}
sort(b, b + m, cmp);
long long j = 0;
long long k = 0;
for (int i = 0; i < m; i++) {
k = j + b[i].num;
for (j; j < k; j++) {
// cout<<"j="<<j<<" value="<<b[i].value<<" a[j]="<<a[j]<<endl;
if (a[j] >= b[i].value) {
k = -1;
break;
}
sum = sum - a[j] + b[i].value;
}
if (k == -1)
break;
}
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int a[100006];
struct lin {
int num;
int value;
};
lin b[100006];
bool cmp(lin a, lin b) { return a.value > b.value; }
int main() {
int n;
int m;
cin >> n >> m;
long long sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
b[i].num = x;
b[i].value = y;
}
sort(b, b + m, cmp);
long long j = 0;
long long k = 0;
for (int i = 0; i < m; i++) {
k = j + b[i].num;
for (j; j < k; j++) {
// cout<<"j="<<j<<" value="<<b[i].value<<" a[j]="<<a[j]<<endl;
if (a[j] >= b[i].value || j >= n) {
k = -1;
break;
}
sum = sum - a[j] + b[i].value;
}
if (k == -1)
break;
}
cout << sum << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 853,693 | 853,692 | u359563380 | cpp |
p03038 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
const int INF = 100000000;
const long long LINF = 1LL << 60;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-6;
using pii = std::pair<int, int>;
using pLL = std::pair<long long, long long>;
using ll = long long;
#define SORT(v) std::sort(v.begin(), v.end())
#define rSORT(v) std::sort(v.begin(), v.end(), std::greater<int>())
int L[100010] = {0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<ll> a(n);
vector<pLL> b(m);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
SORT(a);
vector<ll> s(n + 1, 0);
for (int i = 0; i < m; ++i) {
cin >> b[i].second >> b[i].first;
}
SORT(b);
int j = 0;
auto itr = upper_bound(a.begin(), a.end(), b[m - 1].first);
int index = itr - a.begin();
index--;
for (int i = m - 1; i >= 0; --i) {
int count = 0;
while (count < b[i].second && j < index) {
if (a[j] < b[i].first) {
a[j] = b[i].first;
count++;
}
j++;
}
}
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + a[i];
}
cout << s[n] << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
const int INF = 100000000;
const long long LINF = 1LL << 60;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-6;
using pii = std::pair<int, int>;
using pLL = std::pair<long long, long long>;
using ll = long long;
#define SORT(v) std::sort(v.begin(), v.end())
#define rSORT(v) std::sort(v.begin(), v.end(), std::greater<int>())
int L[100010] = {0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<ll> a(n);
vector<pLL> b(m);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
SORT(a);
vector<ll> s(n + 1, 0);
for (int i = 0; i < m; ++i) {
cin >> b[i].second >> b[i].first;
}
SORT(b);
int j = 0;
auto itr = upper_bound(a.begin(), a.end(), b[m - 1].first);
int index = itr - a.begin();
index--;
for (int i = m - 1; i >= 0; --i) {
int count = 0;
while (count < b[i].second && j <= index) {
if (a[j] < b[i].first) {
a[j] = b[i].first;
count++;
}
j++;
}
}
for (int i = 0; i < n; ++i) {
s[i + 1] = s[i] + a[i];
}
cout << s[n] << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 853,696 | 853,697 | u199371251 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b, n) for (Int i = b; i < Int(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
using Int = long long;
Int inf = 1000000000000000001LL;
using vi = vector<Int>;
using vvi = vector<vi>;
using mapis = unordered_map<Int, string>;
using mapii = unordered_map<Int, Int>;
using pii = pair<Int, Int>;
Int GCD(Int a, Int b) {
if (b == 0)
return a;
if (a < b)
return GCD(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
Int modinv(Int a, Int m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
Int binary_search_index(Int Y, vi &q) {
int left = 0, right = q.size() - 1;
while (right >= left) {
int mid = left + (right - left) / 2;
if (q[mid] == Y)
return mid;
else if (q[mid] > Y)
right = mid - 1;
else if (q[mid] < Y)
left = mid + 1;
}
return -1;
}
int main() {
Int N, M;
vi A, B, C;
cin >> N >> M;
A = vi(N);
B = vi(M);
C = vi(M);
map<Int, Int> c_to_b;
rep(i, N) { cin >> A[i]; }
rep(i, M) {
cin >> B[i] >> C[i];
c_to_b[C[i]] += B[i];
}
sort(C.begin(), C.end(), greater<>());
sort(A.begin(), A.end());
int now_i = 0;
int c_index = 0;
while (now_i < N) {
if (c_index >= M) {
break;
}
auto it = lower_bound(A.begin() + now_i, A.end(), C[c_index]);
int progress_index = it - A.begin();
if (progress_index - now_i >= c_to_b[C[c_index]]) {
int loop = c_to_b[C[c_index]];
REP(j, now_i, loop) { A[j] = C[c_index]; }
now_i += c_to_b[C[c_index]];
c_to_b[C[c_index]] = 0;
} else {
REP(j, now_i, progress_index) { A[j] = C[c_index]; }
c_to_b[C[c_index]] -= progress_index - now_i;
now_i += progress_index;
}
c_index++;
}
Int ans = 0;
rep(i, N) { ans += A[i]; }
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b, n) for (Int i = b; i < Int(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
using Int = long long;
Int inf = 1000000000000000001LL;
using vi = vector<Int>;
using vvi = vector<vi>;
using mapis = unordered_map<Int, string>;
using mapii = unordered_map<Int, Int>;
using pii = pair<Int, Int>;
Int GCD(Int a, Int b) {
if (b == 0)
return a;
if (a < b)
return GCD(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
Int modinv(Int a, Int m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
Int binary_search_index(Int Y, vi &q) {
int left = 0, right = q.size() - 1;
while (right >= left) {
int mid = left + (right - left) / 2;
if (q[mid] == Y)
return mid;
else if (q[mid] > Y)
right = mid - 1;
else if (q[mid] < Y)
left = mid + 1;
}
return -1;
}
int main() {
Int N, M;
vi A, B, C;
cin >> N >> M;
A = vi(N);
B = vi(M);
C = vi(M);
map<Int, Int> c_to_b;
rep(i, N) { cin >> A[i]; }
rep(i, M) {
cin >> B[i] >> C[i];
c_to_b[C[i]] += B[i];
}
sort(C.begin(), C.end(), greater<>());
sort(A.begin(), A.end());
int now_i = 0;
int c_index = 0;
while (now_i < N) {
if (c_index >= M) {
break;
}
auto it = lower_bound(A.begin() + now_i, A.end(), C[c_index]);
int progress_index = it - A.begin();
if (progress_index - now_i >= c_to_b[C[c_index]]) {
int loop = c_to_b[C[c_index]];
REP(j, now_i, now_i + loop) { A[j] = C[c_index]; }
now_i += c_to_b[C[c_index]];
c_to_b[C[c_index]] = 0;
} else {
REP(j, now_i, progress_index) { A[j] = C[c_index]; }
c_to_b[C[c_index]] -= progress_index - now_i;
now_i += progress_index;
}
c_index++;
}
Int ans = 0;
rep(i, N) { ans += A[i]; }
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 853,700 | 853,701 | u375619974 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b, n) for (Int i = b; i < Int(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
using Int = long long;
Int inf = 1000000000000000001LL;
using vi = vector<Int>;
using vvi = vector<vi>;
using mapis = unordered_map<Int, string>;
using mapii = unordered_map<Int, Int>;
using pii = pair<Int, Int>;
Int GCD(Int a, Int b) {
if (b == 0)
return a;
if (a < b)
return GCD(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
Int modinv(Int a, Int m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
Int binary_search_index(Int Y, vi &q) {
int left = 0, right = q.size() - 1;
while (right >= left) {
int mid = left + (right - left) / 2;
if (q[mid] == Y)
return mid;
else if (q[mid] > Y)
right = mid - 1;
else if (q[mid] < Y)
left = mid + 1;
}
return -1;
}
int main() {
Int N, M;
vi A, B, C;
cin >> N >> M;
A = vi(N);
B = vi(M);
C = vi(M);
map<int, int> c_to_b;
rep(i, N) { cin >> A[i]; }
rep(i, M) {
cin >> B[i] >> C[i];
c_to_b[C[i]] += B[i];
}
sort(C.begin(), C.end(), greater<>());
sort(A.begin(), A.end());
int now_i = 0;
int c_index = 0;
while (now_i < N) {
if (c_index >= M) {
break;
}
auto it = lower_bound(A.begin() + now_i, A.end(), C[c_index]);
int progress_index = it - A.begin();
if (progress_index - now_i >= c_to_b[C[c_index]]) {
int loop = c_to_b[C[c_index]];
REP(j, now_i, loop) { A[j] = C[c_index]; }
now_i += c_to_b[C[c_index]];
c_to_b[C[c_index]] = 0;
} else {
REP(j, now_i, progress_index) { A[j] = C[c_index]; }
c_to_b[C[c_index]] -= progress_index - now_i;
now_i += progress_index;
}
c_index++;
}
Int ans = 0;
rep(i, N) { ans += A[i]; }
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, b, n) for (Int i = b; i < Int(n); i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
using Int = long long;
Int inf = 1000000000000000001LL;
using vi = vector<Int>;
using vvi = vector<vi>;
using mapis = unordered_map<Int, string>;
using mapii = unordered_map<Int, Int>;
using pii = pair<Int, Int>;
Int GCD(Int a, Int b) {
if (b == 0)
return a;
if (a < b)
return GCD(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
Int modinv(Int a, Int m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
Int binary_search_index(Int Y, vi &q) {
int left = 0, right = q.size() - 1;
while (right >= left) {
int mid = left + (right - left) / 2;
if (q[mid] == Y)
return mid;
else if (q[mid] > Y)
right = mid - 1;
else if (q[mid] < Y)
left = mid + 1;
}
return -1;
}
int main() {
Int N, M;
vi A, B, C;
cin >> N >> M;
A = vi(N);
B = vi(M);
C = vi(M);
map<Int, Int> c_to_b;
rep(i, N) { cin >> A[i]; }
rep(i, M) {
cin >> B[i] >> C[i];
c_to_b[C[i]] += B[i];
}
sort(C.begin(), C.end(), greater<>());
sort(A.begin(), A.end());
int now_i = 0;
int c_index = 0;
while (now_i < N) {
if (c_index >= M) {
break;
}
auto it = lower_bound(A.begin() + now_i, A.end(), C[c_index]);
int progress_index = it - A.begin();
if (progress_index - now_i >= c_to_b[C[c_index]]) {
int loop = c_to_b[C[c_index]];
REP(j, now_i, now_i + loop) { A[j] = C[c_index]; }
now_i += c_to_b[C[c_index]];
c_to_b[C[c_index]] = 0;
} else {
REP(j, now_i, progress_index) { A[j] = C[c_index]; }
c_to_b[C[c_index]] -= progress_index - now_i;
now_i += progress_index;
}
c_index++;
}
Int ans = 0;
rep(i, N) { ans += A[i]; }
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 853,702 | 853,701 | u375619974 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> a(n), b(m), c(m);
rep(i, n) cin >> a[i];
vector<pair<long long, long long>> BC(m);
rep(i, m) {
cin >> b[i] >> c[i];
BC[i] = make_pair(b[i], c[i]);
}
sort(BC.rbegin(), BC.rend());
sort(a.begin(), a.end());
bool brk = false;
int count = 0;
rep(i, m) {
rep(k, BC[i].first) {
if (BC[i].second < a[count]) {
brk = true;
break;
}
a[count] = BC[i].second;
count++;
}
if (brk) {
break;
}
}
long long sum = 0;
rep(i, n) { sum += (long long)a[i]; }
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> a(n), b(m), c(m);
rep(i, n) cin >> a[i];
vector<pair<long long, long long>> BC(m);
rep(i, m) {
cin >> b[i] >> c[i];
BC[i] = make_pair(c[i], b[i]);
}
sort(BC.rbegin(), BC.rend());
sort(a.begin(), a.end());
bool brk = false;
int count = 0;
rep(i, m) {
rep(k, BC[i].second) {
if (BC[i].first < a[count]) {
brk = true;
break;
}
a[count] = BC[i].first;
count++;
}
if (brk) {
break;
}
}
long long sum = 0;
rep(i, n) { sum += (long long)a[i]; }
cout << sum << endl;
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 853,703 | 853,704 | u130834452 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
/*
cin>>x;
cout<<x<<endl;
*/
int a, b, c, i, j, k, l, n, m, ans = 0;
cin >> n >> m;
vector<pair<int, int>> x;
for (i = 0; i < n; i++) {
cin >> a;
x.push_back(make_pair(a, 1));
}
for (i = 0; i < m; i++) {
cin >> b >> c;
x.push_back(make_pair(c, b));
}
sort(x.begin(), x.end());
reverse(x.begin(), x.end());
long long t = 0;
i = 0;
while (n > 0) {
a = min(x[i].second, n);
t += a * x[i].first;
n -= a;
i++;
}
cout << t << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
/*
cin>>x;
cout<<x<<endl;
*/
int a, b, c, i, j, k, l, n, m, ans = 0;
cin >> n >> m;
vector<pair<int, int>> x;
for (i = 0; i < n; i++) {
cin >> a;
x.push_back(make_pair(a, 1));
}
for (i = 0; i < m; i++) {
cin >> b >> c;
x.push_back(make_pair(c, b));
}
sort(x.begin(), x.end());
reverse(x.begin(), x.end());
long long t = 0;
i = 0;
while (n > 0) {
a = min(x[i].second, n);
t += (long long)a * x[i].first;
n -= a;
i++;
}
cout << t << endl;
} | [
"type_conversion.add"
] | 853,720 | 853,721 | u785689316 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
vector<vector<int>> B(M + N, vector<int>(2));
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < M; i++) {
cin >> B.at(i).at(1) >> B.at(i).at(0);
}
for (int i = M; i < M + N; i++) {
B.at(i).at(1) = 1;
B.at(i).at(0) = A.at(i - M);
}
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
long long sum = 0;
int count = 0;
for (int i = 0; i < M + N; i++) {
int c = 0;
c = count;
count = count + B.at(i).at(1);
if (count <= N) {
sum = sum + B.at(i).at(0) * B.at(i).at(1);
} else {
sum = sum + B.at(i).at(0) * (N - c);
break;
}
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<long long> A(N);
vector<vector<long long>> B(M + N, vector<long long>(2));
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < M; i++) {
cin >> B.at(i).at(1) >> B.at(i).at(0);
}
for (int i = M; i < M + N; i++) {
B.at(i).at(1) = 1;
B.at(i).at(0) = A.at(i - M);
}
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
long long sum = 0;
int count = 0;
for (int i = 0; i < M + N; i++) {
int c = 0;
c = count;
count = count + B.at(i).at(1);
if (count <= N) {
sum = sum + B.at(i).at(0) * B.at(i).at(1);
} else {
sum = sum + B.at(i).at(0) * (N - c);
break;
}
}
cout << sum << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,724 | 853,725 | u028061225 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> b(m, pair<int, int>());
vector<long long> sum(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (i == 0)
sum[i] = a[i];
else
sum[i] = sum[i - 1] + a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i].second >> b[i].first;
}
sort(b.begin(), b.end());
int MIN[m];
int s = 0;
for (int i = 0; i < m; i++) {
MIN[i] = upper_bound(a.begin(), a.end(), b[i].first) - a.begin();
}
for (int i = m - 1; i >= 0; i--) {
if (MIN[i] >= 0) {
for (int j = s; j <= MIN[i] && j <= b[i].second + s; j++) {
if (j == MIN[i] || j == b[i].second + s) {
s = j;
break;
}
if (j < n) {
a[j] = b[i].first;
}
}
}
}
int SUM = 0;
for (int i = 0; i < n; i++) {
SUM += a[i];
}
cout << SUM << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> b(m, pair<int, int>());
vector<long long> sum(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (i == 0)
sum[i] = a[i];
else
sum[i] = sum[i - 1] + a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i].second >> b[i].first;
}
sort(b.begin(), b.end());
int MIN[m];
int s = 0;
for (int i = 0; i < m; i++) {
MIN[i] = upper_bound(a.begin(), a.end(), b[i].first) - a.begin();
}
for (int i = m - 1; i >= 0; i--) {
if (MIN[i] >= 0) {
for (int j = s; j <= MIN[i] && j <= b[i].second + s; j++) {
if (j == MIN[i] || j == b[i].second + s) {
s = j;
break;
}
if (j < n) {
a[j] = b[i].first;
}
}
}
}
long long SUM = 0;
for (int i = 0; i < n; i++) {
SUM += a[i];
}
cout << SUM << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,726 | 853,727 | u280114218 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int M = 1e5 + 50;
int a[M] = {0};
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
vector<pair<int, int>> v;
for (int i = 0; i < m; i++) {
int f, s;
scanf("%d%d", &s, &f);
v.push_back({f, s});
}
sort(v.begin(), v.end());
int vs = v.size();
for (int i = 0; i < n; i++) {
if (a[i] < v[vs].first) {
a[i] = v[vs].first;
v[vs].second--;
}
if (v[vs].second == 0)
vs--;
if (vs < 0)
break;
}
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
printf("%lld\n", sum);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int M = 1e5 + 50;
int a[M] = {0};
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
vector<pair<int, int>> v;
for (int i = 0; i < m; i++) {
int f, s;
scanf("%d%d", &s, &f);
v.push_back({f, s});
}
sort(v.begin(), v.end());
int vs = v.size();
vs--;
for (int i = 0; i < n; i++) {
if (a[i] < v[vs].first) {
a[i] = v[vs].first;
v[vs].second--;
}
if (v[vs].second == 0)
vs--;
if (vs < 0)
break;
}
long long sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
printf("%lld\n", sum);
return 0;
} | [
"expression.unary.arithmetic.add"
] | 853,728 | 853,729 | u061597928 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
bool comp(const vector<ll> &a, const vector<ll> &b) { return a[1] > b[1]; }
int main() {
int N, M;
cin >> N >> M;
ll tmp, b, c, p;
vector<ll> A;
vector<vector<ll>> move;
for (int i = 0; i < N; i++) {
cin >> tmp;
A.push_back(tmp);
}
sort(A.begin(), A.end());
ll Bmax = -1, Cmax = -1;
for (int i = 0; i < M; i++) {
cin >> b >> c;
move.emplace_back(vector<ll>({b, c}));
}
sort(move.begin(), move.end(), comp);
ll replaced = 0, pl, pr;
vector<vector<ll>> pickup;
for (auto e : move) {
if (A.empty())
break;
pl = (long long)(lower_bound(A.begin(), A.end(), e[1]) - A.begin()) - 1;
p = min(pl, e[0]);
if (p >= 0) {
replaced += p;
pickup.emplace_back(vector<ll>({p, e[1]}));
A.erase(A.begin(), A.begin() + p);
} else
break;
}
ll ans = 0;
for (auto e : pickup) {
ans += e[0] * e[1];
}
for (ll i = 0; i < A.size(); i++) {
ans += A[i];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
bool comp(const vector<ll> &a, const vector<ll> &b) { return a[1] > b[1]; }
int main() {
int N, M;
cin >> N >> M;
ll tmp, b, c, p;
vector<ll> A;
vector<vector<ll>> move;
for (int i = 0; i < N; i++) {
cin >> tmp;
A.push_back(tmp);
}
sort(A.begin(), A.end());
ll Bmax = -1, Cmax = -1;
for (int i = 0; i < M; i++) {
cin >> b >> c;
move.emplace_back(vector<ll>({b, c}));
}
sort(move.begin(), move.end(), comp);
ll replaced = 0, pl, pr;
vector<vector<ll>> pickup;
for (auto e : move) {
if (A.empty())
break;
pl = (long long)(lower_bound(A.begin(), A.end(), e[1]) - A.begin());
p = min(pl, e[0]);
if (p >= 0) {
replaced += p;
pickup.emplace_back(vector<ll>({p, e[1]}));
A.erase(A.begin(), A.begin() + p);
} else
break;
}
ll ans = 0;
for (auto e : pickup) {
ans += e[0] * e[1];
}
for (ll i = 0; i < A.size(); i++) {
ans += A[i];
}
cout << ans << endl;
return 0;
} | [
"expression.operation.binary.remove"
] | 853,730 | 853,731 | u816580121 | cpp |
p03038 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end()) // O(log n)
#define contains(c, x) (find((c).begin(), (c).end(), x) != (c).end()) // O(n)
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mll map<ll, ll>
#define intv(x, a, b) ((x) >= a && (x) <= b)
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define _for(i, end) for (__typeof(end) i = 0; i < (end); i += 1)
#define all(x) (x).begin(), (x).end()
//#define len(array) (sizeof(array)/sizeof((array)[0]))
#define what_is(x) cerr << #x << " is " << x << endl;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
#define mod(x, m) ((((x) % (m)) + (m)) % (m))
const double PI = 2 * acos(.0);
const int INF = 0x3f3f3f3f;
const ll LLINF = 1000000000000000005LL;
;
const ll MOD = (ll)(1e9) + 7;
void _mod(ll &x) { x = mod(x, MOD); }
// const ll MOD = (ll) 998244353 ;
const double EPS = 1e-10;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
//#define int ll
class DIntegerCards {
public:
ll N, M;
ll A[101010];
map<int, int> Mp;
void solve(std::istream &cin, std::ostream &cout) {
cin >> N >> M;
memset(A, 0, sizeof(A));
_for(i, N) cin >> A[i];
_for(i, M) {
ll a, b;
cin >> a >> b;
Mp[b] += a;
}
sort(A, A + N);
int ind = 0;
ll sum = accumulate(A, A + N, 0ll);
while (!Mp.empty()) {
auto it = Mp.rbegin();
if (A[ind] >= it->first || ind == N - 1) {
cout << sum << endl;
return;
}
sum += it->first - A[ind];
ind++;
(it->second)--;
if (it->second == 0)
Mp.erase(it->first);
}
cout << sum << endl;
}
};
#undef int
int main() {
DIntegerCards solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end()) // O(log n)
#define contains(c, x) (find((c).begin(), (c).end(), x) != (c).end()) // O(n)
#define pll pair<ll, ll>
#define pii pair<int, int>
#define mll map<ll, ll>
#define intv(x, a, b) ((x) >= a && (x) <= b)
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define _for(i, end) for (__typeof(end) i = 0; i < (end); i += 1)
#define all(x) (x).begin(), (x).end()
//#define len(array) (sizeof(array)/sizeof((array)[0]))
#define what_is(x) cerr << #x << " is " << x << endl;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
#define mod(x, m) ((((x) % (m)) + (m)) % (m))
const double PI = 2 * acos(.0);
const int INF = 0x3f3f3f3f;
const ll LLINF = 1000000000000000005LL;
;
const ll MOD = (ll)(1e9) + 7;
void _mod(ll &x) { x = mod(x, MOD); }
// const ll MOD = (ll) 998244353 ;
const double EPS = 1e-10;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
//#define int ll
class DIntegerCards {
public:
ll N, M;
ll A[101010];
map<int, int> Mp;
void solve(std::istream &cin, std::ostream &cout) {
cin >> N >> M;
memset(A, 0, sizeof(A));
_for(i, N) cin >> A[i];
_for(i, M) {
ll a, b;
cin >> a >> b;
Mp[b] += a;
}
sort(A, A + N);
int ind = 0;
ll sum = accumulate(A, A + N, 0ll);
while (!Mp.empty()) {
auto it = Mp.rbegin();
if (A[ind] >= it->first || ind == N) {
cout << sum << endl;
return;
}
sum += it->first - A[ind];
ind++;
(it->second)--;
if (it->second == 0)
Mp.erase(it->first);
}
cout << sum << endl;
}
};
#undef int
int main() {
DIntegerCards solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| [
"expression.operation.binary.remove"
] | 853,732 | 853,733 | u093219895 | cpp |
p03038 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
struct P {
LL f, s;
};
bool comp(P p1, P p2) { return p1.f > p2.f; }
void dump(const vector<P> a) {
int n = a.size();
for (int i = 0; i < n; i++) {
cout << a[i].f << " " << a[i].s << endl;
}
}
/*
vector<P> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].f>>a[i].s;
}
sort(a.begin(), a.end(),comp);
*/
int main() {
LL n, m;
cin >> n >> m;
vector<LL> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
vector<LL> imos(n + 10);
for (int i = n - 1; i >= 0; i--) {
imos[i] = imos[i + 1] + a[i];
}
vector<P> b(m + 10);
for (int i = 0; i < m; i++) {
cin >> b[i].s >> b[i].f;
}
sort(b.begin(), b.end(), comp);
LL ans = imos[0];
LL sum = 0;
LL p = 0;
LL sumafter = 0;
for (int i = 1; i < n; i++) {
sum += a[i - 1];
if (b[p].s == 0) {
p++;
}
if (p >= m + 1)
break;
if (b[p].s > 0) {
sumafter += b[p].f;
b[p].s--;
}
LL d = max(sumafter, sum);
LL tmp = d + imos[i];
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define EXISTch(s, c) \
((((s).find_first_of(c)) != std::string::npos) ? 1 : 0) // cがあれば1 if(1)
#define SORT(c) sort((c).begin(), (c).end())
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = (int)1000000007;
const LL MOD = (LL)1000000007; // 10^9+7
const LL INF2 = (LL)100000000000000000; // 10^18
struct P {
LL f, s;
};
bool comp(P p1, P p2) { return p1.f > p2.f; }
void dump(const vector<P> a) {
int n = a.size();
for (int i = 0; i < n; i++) {
cout << a[i].f << " " << a[i].s << endl;
}
}
/*
vector<P> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].f>>a[i].s;
}
sort(a.begin(), a.end(),comp);
*/
int main() {
LL n, m;
cin >> n >> m;
vector<LL> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
vector<LL> imos(n + 10);
for (int i = n - 1; i >= 0; i--) {
imos[i] = imos[i + 1] + a[i];
}
vector<P> b(m + 10);
for (int i = 0; i < m; i++) {
cin >> b[i].s >> b[i].f;
}
sort(b.begin(), b.end(), comp);
LL ans = imos[0];
LL sum = 0;
LL p = 0;
LL sumafter = 0;
for (int i = 1; i < n + 1; i++) {
sum += a[i - 1];
if (b[p].s == 0) {
p++;
}
if (p >= m + 1)
break;
if (b[p].s > 0) {
sumafter += b[p].f;
b[p].s--;
}
LL d = max(sumafter, sum);
LL tmp = d + imos[i];
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 853,734 | 853,735 | u874996917 | cpp |
p03038 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define LL long long
int n, m;
vector<LL> a;
vector<pair<int, LL>> v;
int main() {
cin >> n >> m;
REP(i, n) {
LL tmp;
cin >> tmp;
a.push_back(tmp);
}
sort(ALL(a));
REP(i, m) {
pair<int, LL> p;
cin >> p.first >> p.second;
v.push_back(p);
}
sort(ALL(v), [](pair<int, LL> p1, pair<int, LL> p2) {
return p1.second > p2.second;
});
int ind = 0, ind_in;
LL ret = 0;
bool brk = false;
REP(i, v.size()) {
ind_in = ind;
FOR(j, ind, ind + v[i].first) {
if (a[j] < v[i].second) {
ret += v[i].second;
ind_in++;
} else {
brk = true;
break;
}
}
ind = ind_in;
if (brk)
break;
}
FOR(i, ind, n) { ret += a[i]; }
cout << ret << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define LL long long
int n, m;
vector<LL> a;
vector<pair<int, LL>> v;
int main() {
cin >> n >> m;
REP(i, n) {
LL tmp;
cin >> tmp;
a.push_back(tmp);
}
sort(ALL(a));
REP(i, m) {
pair<int, LL> p;
cin >> p.first >> p.second;
v.push_back(p);
}
sort(ALL(v), [](pair<int, LL> p1, pair<int, LL> p2) {
return p1.second > p2.second;
});
int ind = 0, ind_in;
LL ret = 0;
bool brk = false;
REP(i, v.size()) {
ind_in = ind;
FOR(j, ind, min(n, ind + v[i].first)) {
if (a[j] < v[i].second) {
ret += v[i].second;
ind_in++;
} else {
brk = true;
break;
}
}
ind = ind_in;
if (brk)
break;
}
FOR(i, ind, n) { ret += a[i]; }
cout << ret << endl;
return 0;
}
| [
"call.arguments.add",
"call.arguments.change"
] | 853,736 | 853,737 | u190952243 | cpp |
p03038 | /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define FZ(n) memset((n), 0, sizeof(n))
#define FMO(n) memset((n), -1, sizeof(n))
#define unset unordered_set
#define ii pair<int, int>
#define vii vector<ii>
#define F first
#define S second
#define PB push_back
#define ALL(x) begin(x), end(x)
#define SZ(x) ((int)(x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define bitcount(n) __builtin_popcountll(n)
template <typename T, typename U>
std::pair<T, U> operator+(const std::pair<T, U> &l, const std::pair<T, U> &r) {
return {l.first + r.first, l.second + r.second};
}
typedef void (*callback_function)(void); // type for conciseness
const long long ZERO = 0LL;
const long long INF64 = 1e18;
const int INF32 = 1e9;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0L);
const double EPS = static_cast<double>(1e-9);
typedef long long ll;
void FILEIO() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
// void FILEIO() { freopen("namenum.in", "r", stdin); freopen("namenum.out",
// "w", stdout); }
void input() {}
const int M = 1e6;
int n, m;
vi a;
vii cb;
void showA() {
FOR(i, 0, n) cout << a[i] << ", ";
cout << endl;
}
void showCB() {
FOR(i, 0, m) cout << cb[i].F << " - " << cb[i].S << "; ";
cout << endl;
}
void solve() {
cin >> n >> m;
a.resize(n);
FOR(i, 0, n) cin >> a[i];
cb.resize(m);
FOR(i, 0, m) cin >> cb[i].S >> cb[i].F;
sort(a.begin(), a.end());
// showA();
sort(cb.begin(), cb.end());
reverse(cb.begin(), cb.end());
// showCB();
int replaced = 0, currentB = 0, i = 0;
while (i < n) {
// cout << " replaced = " << replaced <<", currentB = " << currentB
// << ", i = " << i << endl;
replaced++;
if (replaced <= cb[currentB].S) {
if (a[i] < cb[currentB].F) {
a[i] = cb[currentB].F;
} else
break;
i++;
showA();
} else {
replaced = 0;
currentB++;
if (currentB >= m)
break;
}
}
// showA();
int sum = 0;
FOR(i, 0, n) sum += a[i];
cout << sum << endl;
}
//#undef int
signed main() {
//#define int long long
ios_base::sync_with_stdio(false);
cin.tie();
// FILEIO();
// auto beginProgram = chrono::steady_clock::now();
// while (1)
// {
input();
solve();
// }
// auto endProgram = chrono::steady_clock::now();
return 0;
}
| /*
ID: thanhvq1
LANG: C++14
PROB: namenum
*/
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#define int long long
#define double long double
#define vec vector
#define vi vector<int>
#define FZ(n) memset((n), 0, sizeof(n))
#define FMO(n) memset((n), -1, sizeof(n))
#define unset unordered_set
#define ii pair<int, int>
#define vii vector<ii>
#define F first
#define S second
#define PB push_back
#define ALL(x) begin(x), end(x)
#define SZ(x) ((int)(x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define bitcount(n) __builtin_popcountll(n)
template <typename T, typename U>
std::pair<T, U> operator+(const std::pair<T, U> &l, const std::pair<T, U> &r) {
return {l.first + r.first, l.second + r.second};
}
typedef void (*callback_function)(void); // type for conciseness
const long long ZERO = 0LL;
const long long INF64 = 1e18;
const int INF32 = 1e9;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0L);
const double EPS = static_cast<double>(1e-9);
typedef long long ll;
void FILEIO() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
// void FILEIO() { freopen("namenum.in", "r", stdin); freopen("namenum.out",
// "w", stdout); }
void input() {}
const int M = 1e6;
int n, m;
vi a;
vii cb;
void showA() {
FOR(i, 0, n) cout << a[i] << ", ";
cout << endl;
}
void showCB() {
FOR(i, 0, m) cout << cb[i].F << " - " << cb[i].S << "; ";
cout << endl;
}
void solve() {
cin >> n >> m;
a.resize(n);
FOR(i, 0, n) cin >> a[i];
cb.resize(m);
FOR(i, 0, m) cin >> cb[i].S >> cb[i].F;
sort(a.begin(), a.end());
// showA();
sort(cb.begin(), cb.end());
reverse(cb.begin(), cb.end());
// showCB();
int replaced = 0, currentB = 0, i = 0;
while (i < n) {
// cout << " replaced = " << replaced <<", currentB = " << currentB
// << ", i = " << i << endl;
replaced++;
if (replaced <= cb[currentB].S) {
if (a[i] < cb[currentB].F) {
a[i] = cb[currentB].F;
} else
break;
i++;
// showA();
} else {
replaced = 0;
currentB++;
if (currentB >= m)
break;
}
}
// showA();
int sum = 0;
FOR(i, 0, n) sum += a[i];
cout << sum << endl;
}
//#undef int
signed main() {
//#define int long long
ios_base::sync_with_stdio(false);
cin.tie();
// FILEIO();
// auto beginProgram = chrono::steady_clock::now();
// while (1)
// {
input();
solve();
// }
// auto endProgram = chrono::steady_clock::now();
return 0;
}
| [
"call.remove"
] | 853,746 | 853,747 | u210484769 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<Pll> vp;
typedef vector<bool> vb;
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define rrep(i, a, n) for (ll i = (a); i > (n); --i)
#define erep(i, a, n) for (ll i = (a); i <= (n); ++i)
#define rerep(i, a, n) for (ll i = (a); i >= (n); --i)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define SORT(x) sort(all(x))
#define RSORT(x) sort(all(x), greater<ll>())
#define vec_max(V) *max_element(all(V))
#define vec_min(V) *min_element(all(V))
#define vec_sum(V) accumulate(all(V), 0LL)
#define print(X) cout << (X) << "\n"
#define _ << " " <<
#define Yes print("Yes")
#define No print("No")
static const int INF = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
vll A(N);
rep(i, 0, N) cin >> A[i];
sort(all(A));
vp ba(M);
rep(i, 0, M) {
ll a, b;
cin >> a >> b;
ba[i] = mp(b, a);
}
SORT(ba);
ll index = 0;
rerep(i, N - 1, 0) {
rep(j, 0, ba[i].second) {
if (index >= N)
break;
if (ba[i].first > A[index]) {
A[index] = ba[i].first;
index++;
} else
break;
}
}
print(vec_sum(A));
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef string str;
typedef pair<ll, ll> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<char> vc;
typedef vector<str> vs;
typedef vector<Pll> vp;
typedef vector<bool> vb;
#define rep(i, a, n) for (ll i = (a); i < (n); ++i)
#define rrep(i, a, n) for (ll i = (a); i > (n); --i)
#define erep(i, a, n) for (ll i = (a); i <= (n); ++i)
#define rerep(i, a, n) for (ll i = (a); i >= (n); --i)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define SORT(x) sort(all(x))
#define RSORT(x) sort(all(x), greater<ll>())
#define vec_max(V) *max_element(all(V))
#define vec_min(V) *min_element(all(V))
#define vec_sum(V) accumulate(all(V), 0LL)
#define print(X) cout << (X) << "\n"
#define _ << " " <<
#define Yes print("Yes")
#define No print("No")
static const int INF = 1e+9 + 7;
int main() {
ll N, M;
cin >> N >> M;
vll A(N);
rep(i, 0, N) cin >> A[i];
sort(all(A));
vp ba(M);
rep(i, 0, M) {
ll a, b;
cin >> a >> b;
ba[i] = mp(b, a);
}
SORT(ba);
ll index = 0;
rerep(i, M - 1, 0) {
rep(j, 0, ba[i].second) {
if (index >= N)
break;
if (ba[i].first > A[index]) {
A[index] = ba[i].first;
index++;
} else
break;
}
}
print(vec_sum(A));
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 853,770 | 853,771 | u103539599 | cpp |
p03038 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a;
for (int i = 0; i < N; ++i) {
long int A;
cin >> A;
a.push_back(A);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int mn = a[N - 1];
vector<pair<long int, long int>> p;
for (int i = 0; i < M; ++i) {
long int B, C;
cin >> B >> C;
if (C > mn)
p.push_back(make_pair(C, B));
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
int t = 0;
for (int i = 0; i < p.size(); ++i) {
if (t > N)
break;
for (int j = 0; j < p[i].second; ++j) {
a.push_back(p[i].first);
t += p[i].second;
}
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
long int ans = 0;
for (int i = 0; i < N; ++i)
ans += a[i];
cout << ans << endl;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> a;
for (int i = 0; i < N; ++i) {
long int A;
cin >> A;
a.push_back(A);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int mn = a[N - 1];
vector<pair<long int, long int>> p;
for (int i = 0; i < M; ++i) {
long int B, C;
cin >> B >> C;
if (C > mn)
p.push_back(make_pair(C, B));
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
int t = 0;
for (int i = 0; i < p.size(); ++i) {
if (t > N)
break;
for (int j = 0; j < p[i].second; ++j) {
a.push_back(p[i].first);
}
t += p[i].second;
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
long int ans = 0;
for (int i = 0; i < N; ++i)
ans += a[i];
cout << ans << endl;
}
| [] | 853,772 | 853,773 | u041282550 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = LLONG_MAX;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n);
vector<pair<ll, ll>> cb(m);
ll mi = INF;
for (int i = 0; i < n; i++) {
cin >> a[i];
mi = min(mi, a[i]);
}
for (int i = 0; i < m; i++) {
ll b, c;
cin >> b >> c;
cb[i] = make_pair(c, b);
}
cb.push_back(make_pair(-1, n));
sort(a.begin(), a.end(), greater<ll>());
sort(cb.begin(), cb.end(), greater<pair<ll, ll>>());
int i = 0;
int j = 0;
ll ans = 0;
while (n) {
if (a[i] > cb[j].first) {
ans += a[i];
i++;
n--;
} else {
int tmp = cb[j].second;
if (cb[j].second > n)
tmp = n;
ans += cb[j].first * tmp;
j++;
n -= tmp;
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = LLONG_MAX;
int main() {
int n, m;
cin >> n >> m;
vector<ll> a(n);
vector<pair<ll, ll>> cb(m);
ll mi = INF;
for (int i = 0; i < n; i++) {
cin >> a[i];
mi = min(mi, a[i]);
}
for (int i = 0; i < m; i++) {
ll b, c;
cin >> b >> c;
cb[i] = make_pair(c, b);
}
cb.push_back(make_pair(-1, n));
sort(a.begin(), a.end(), greater<ll>());
sort(cb.begin(), cb.end(), greater<pair<ll, ll>>());
int i = 0;
int j = 0;
ll ans = 0;
while (n) {
if (a[i] > cb[j].first) {
ans += a[i];
i++;
n--;
} else {
int tmp = cb[j].second;
if (cb[j].second > n)
tmp = n;
ans += cb[j].first * tmp;
j++;
n -= tmp;
}
}
cout << ans << endl;
} | [] | 853,788 | 853,789 | u850894780 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
int gcd(int n, int m) {
if (n == 0)
return m;
return gcd(m % n, n);
}
int main() {
int N, M;
cin >> N >> M;
priority_queue<int, vector<int>, greater<>> a;
vector<pair<int, int>> b_c(M);
for (int i = 0; i < N; ++i) {
int tmp;
cin >> tmp;
a.push(tmp);
}
for (int i = 0; i < M; ++i) {
int b, c;
cin >> b >> c;
b_c[i] = make_pair(b, c);
}
sort(b_c.begin(), b_c.end(),
[](const auto a, const auto b) { return a.second < b.second; });
for (int i = 0; i < M; ++i) {
if (a.top() >= b_c[i].second)
break;
for (int j = 0; j < b_c[i].first; ++j) {
if (a.top() >= b_c[i].second)
break;
a.push(b_c[i].second);
a.pop();
}
}
uint64_t ans = 0;
for (int i = 0; i < N; ++i) {
ans += a.top();
a.pop();
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
int gcd(int n, int m) {
if (n == 0)
return m;
return gcd(m % n, n);
}
int main() {
int N, M;
cin >> N >> M;
priority_queue<int, vector<int>, greater<>> a;
vector<pair<int, int>> b_c(M);
for (int i = 0; i < N; ++i) {
int tmp;
cin >> tmp;
a.push(tmp);
}
for (int i = 0; i < M; ++i) {
int b, c;
cin >> b >> c;
b_c[i] = make_pair(b, c);
}
sort(b_c.begin(), b_c.end(),
[](const auto a, const auto b) { return a.second > b.second; });
for (int i = 0; i < M; ++i) {
if (a.top() >= b_c[i].second)
break;
for (int j = 0; j < b_c[i].first; ++j) {
if (a.top() >= b_c[i].second)
break;
a.push(b_c[i].second);
a.pop();
}
}
uint64_t ans = 0;
for (int i = 0; i < N; ++i) {
ans += a.top();
a.pop();
}
cout << ans << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 853,790 | 853,791 | u671357638 | cpp |
p03038 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
long long ans = 0;
vector<pair<int, int>> pairs;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
pairs.push_back(make_pair(a, 1));
}
for (int i = 0; i < m; i++) {
int b, c;
cin >> b >> c;
pairs.push_back(make_pair(c, b));
}
sort(pairs.begin(), pairs.end(), greater<pair<int, int>>());
int i = 0;
while (1) {
if (n - pairs[i].second >= 0) {
n = n - pairs[i].second;
ans += pairs[i].first * pairs[i].second;
i++;
} else {
ans += pairs[i].first * n;
break;
}
// cout << ans << endl;
}
cout << ans << endl;
} | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
long long ans = 0;
vector<pair<long long, long long>> pairs;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
pairs.push_back(make_pair(a, 1));
}
for (int i = 0; i < m; i++) {
long long b, c;
cin >> b >> c;
pairs.push_back(make_pair(c, b));
}
sort(pairs.begin(), pairs.end(), greater<pair<int, int>>());
int i = 0;
while (1) {
if (n - pairs[i].second >= 0) {
n = n - pairs[i].second;
ans += pairs[i].first * pairs[i].second;
i++;
} else {
ans += pairs[i].first * n;
break;
}
// cout << ans << endl;
}
cout << ans << endl;
}
| [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,792 | 853,793 | u227764848 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(M), C(M);
map<int, int> m;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (m.find(A[i]) == m.end())
m[A[i]] = 1;
else
m[A[i]]++;
}
for (int i = 0; i < M; i++) {
cin >> B[i] >> C[i];
if (m.find(C[i]) == m.end())
m[C[i]] = B[i];
else
m[C[i]] += B[i];
}
ll c = 0, sum = 0;
for (auto it = m.rbegin(); it != m.rend(); ++it) {
if (c + it->second >= N) {
sum += it->first * (N - c);
break;
}
c += it->second;
sum += it->first * it->second;
}
cout << sum << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(M), C(M);
map<ll, ll> m;
for (int i = 0; i < N; i++) {
cin >> A[i];
if (m.find(A[i]) == m.end())
m[A[i]] = 1;
else
m[A[i]]++;
}
for (int i = 0; i < M; i++) {
cin >> B[i] >> C[i];
if (m.find(C[i]) == m.end())
m[C[i]] = B[i];
else
m[C[i]] += B[i];
}
ll c = 0, sum = 0;
for (auto it = m.rbegin(); it != m.rend(); ++it) {
if (c + it->second >= N) {
sum += it->first * (N - c);
break;
}
c += it->second;
sum += it->first * it->second;
}
cout << sum << endl;
} | [] | 853,802 | 853,803 | u024469792 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
bool flag = false;
long long int N, M, ans = 0, k = 0;
cin >> N >> M;
vector<long long int> A(N, 0);
vector<pair<long long int, long long int>> p(M);
for (int i = 0; i < N; i++) {
cin >> A[i];
ans += A[i];
}
sort(A.begin(), A.end());
for (int i = 0; i < M; i++)
cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
for (int i = M - 1; i >= 0; i--) {
for (int j = 0; j < p[i].second; j++) {
if (A[k] < p[i].first) {
ans += (p[i].first - A[k]);
k++;
} else
flag = true;
if (flag)
break;
}
if (flag)
break;
}
cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
bool flag = false;
long long int N, M, ans = 0, k = 0;
cin >> N >> M;
vector<long long int> A(N, 0);
vector<pair<long long int, long long int>> p(M);
for (int i = 0; i < N; i++) {
cin >> A[i];
ans += A[i];
}
sort(A.begin(), A.end());
for (int i = 0; i < M; i++)
cin >> p[i].second >> p[i].first;
sort(p.begin(), p.end());
for (int i = M - 1; i >= 0; i--) {
for (int j = 0; j < p[i].second; j++) {
if (A[k] < p[i].first && k != N) {
ans += (p[i].first - A[k]);
k++;
} else
flag = true;
if (flag)
break;
}
if (flag)
break;
}
cout << ans;
}
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 853,804 | 853,805 | u444349080 | cpp |
p03038 | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool compare(const pair<long long, long long> &x,
const pair<long long, long long> &y) {
return x.second > y.second;
}
int main() {
int n, m;
vector<long long> a;
vector<pair<long long, long long>> bc;
cin >> n >> m;
for (int i = 0; i < n; i++) {
long long a_;
cin >> a_;
a.push_back(a_);
}
sort(a.begin(), a.end());
for (int i = 0; i < m; i++) {
long long b_, c_;
cin >> b_ >> c_;
bc.push_back(make_pair(b_, c_));
}
sort(bc.begin(), bc.end(), compare);
int ai = 0;
int bci = 0;
long long ans = 0;
while (1) {
if (bci == m || a[ai] >= bc[bci].second)
break;
if (a[ai] < bc[bci].second && bc[bci].first > 0) {
ans += bc[bci].second;
ai++;
bc[bci].first--;
} else if (bc[bci].first == 0) {
bci++;
}
}
for (; ai < n; ai++) {
ans += a[ai];
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool compare(const pair<long long, long long> &x,
const pair<long long, long long> &y) {
return x.second > y.second;
}
int main() {
int n, m;
vector<long long> a;
vector<pair<long long, long long>> bc;
cin >> n >> m;
for (int i = 0; i < n; i++) {
long long a_;
cin >> a_;
a.push_back(a_);
}
sort(a.begin(), a.end());
for (int i = 0; i < m; i++) {
long long b_, c_;
cin >> b_ >> c_;
bc.push_back(make_pair(b_, c_));
}
sort(bc.begin(), bc.end(), compare);
int ai = 0;
int bci = 0;
long long ans = 0;
while (1) {
if (bci == m || a[ai] >= bc[bci].second || ai == n)
break;
if (a[ai] < bc[bci].second && bc[bci].first > 0) {
ans += bc[bci].second;
ai++;
bc[bci].first--;
} else if (bc[bci].first == 0) {
bci++;
}
}
for (; ai < n; ai++) {
ans += a[ai];
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 853,818 | 853,819 | u576712004 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll inf = 1e9 + 7;
int n, m;
int main() {
cin >> n >> m;
vector<P> bc(m);
vector<ll> a(n);
rep(i, n) cin >> a[i];
rep(i, m) {
cin >> bc[i].second;
cin >> bc[i].first;
}
sort(bc.begin(), bc.end());
reverse(bc.begin(), bc.end());
sort(a.begin(), a.end());
int pos = 0, b = 0;
while (pos < n) {
if (bc[b].second == 0)
b++;
else if (a[pos] < bc[b].first) {
a[pos] = bc[b].first;
bc[b].second--, pos++;
} else
break;
}
ll ans = 0;
rep(i, n) ans += a[i];
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll inf = 1e9 + 7;
int n, m;
int main() {
cin >> n >> m;
vector<P> bc(m);
vector<ll> a(n);
rep(i, n) cin >> a[i];
rep(i, m) {
cin >> bc[i].second;
cin >> bc[i].first;
}
sort(bc.begin(), bc.end());
reverse(bc.begin(), bc.end());
sort(a.begin(), a.end());
int pos = 0, b = 0;
while (pos < n && b < m) {
if (bc[b].second == 0)
b++;
else if (a[pos] < bc[b].first) {
a[pos] = bc[b].first;
bc[b].second--, pos++;
} else
break;
}
ll ans = 0;
rep(i, n) ans += a[i];
cout << ans << endl;
// rep(i,n) cout<<a[i]<<endl;
} | [
"control_flow.loop.condition.change"
] | 853,828 | 853,827 | u620242073 | cpp |
p03038 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll modpow(ll n, ll k) {
if (k == 1) {
return n;
} else if (k == 0) {
return 1;
} else if (k % 2 == 0) {
ll memo = modpow(n, k / 2) % MOD;
return memo * memo % MOD;
} else {
return n * modpow(n, k - 1) % MOD;
}
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> v;
REP(i, n) {
ll t;
cin >> t;
v.pb(t);
}
VSORT(v);
vector<LP> vlp;
REP(i, m) {
ll b, c;
cin >> b >> c;
LP lp;
lp.first = c;
lp.second = b;
vlp.pb(lp);
}
sort(vlp.begin(), vlp.end());
ll vlpCounter = m - 1;
ll vCounter = 0;
bool bo = false;
while (vlpCounter >= 0) {
ll c = vlp[vlpCounter].first;
ll b = vlp[vlpCounter].second;
for (int i = vCounter; i < vCounter + b; i++) {
if (i == n - 1) {
bo = true;
break;
}
if (v[i] <= c) {
v[i] = c;
} else {
bo = true;
break;
}
}
if (bo)
break;
vCounter += b;
vlpCounter--;
/*vector<ll>::iterator it = lower_bound(v.begin(),v.end(),c);
if(it==v.begin())break;
ll num = it - v.begin();
if(num<=b){
REP(i,num){
v[i] = c;
}
break;
}else{
for(int i = num-1;i>=num - b;i--){
v[i] = c;
}
}
vlpCounter--;
REP(i,n){
cout<<v[i]<<" ";
}
cout<<endl;*/
}
ll ans = 0;
REP(i, n) { ans += v[i]; }
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll modpow(ll n, ll k) {
if (k == 1) {
return n;
} else if (k == 0) {
return 1;
} else if (k % 2 == 0) {
ll memo = modpow(n, k / 2) % MOD;
return memo * memo % MOD;
} else {
return n * modpow(n, k - 1) % MOD;
}
}
int main() {
ll n, m;
cin >> n >> m;
vector<ll> v;
REP(i, n) {
ll t;
cin >> t;
v.pb(t);
}
VSORT(v);
vector<LP> vlp;
REP(i, m) {
ll b, c;
cin >> b >> c;
LP lp;
lp.first = c;
lp.second = b;
vlp.pb(lp);
}
sort(vlp.begin(), vlp.end());
ll vlpCounter = m - 1;
ll vCounter = 0;
bool bo = false;
while (vlpCounter >= 0) {
ll c = vlp[vlpCounter].first;
ll b = vlp[vlpCounter].second;
for (int i = vCounter; i < vCounter + b; i++) {
if (i == n) {
bo = true;
break;
}
if (v[i] <= c) {
v[i] = c;
} else {
bo = true;
break;
}
}
if (bo)
break;
vCounter += b;
vlpCounter--;
/*vector<ll>::iterator it = lower_bound(v.begin(),v.end(),c);
if(it==v.begin())break;
ll num = it - v.begin();
if(num<=b){
REP(i,num){
v[i] = c;
}
break;
}else{
for(int i = num-1;i>=num - b;i--){
v[i] = c;
}
}
vlpCounter--;
REP(i,n){
cout<<v[i]<<" ";
}
cout<<endl;*/
}
ll ans = 0;
REP(i, n) { ans += v[i]; }
cout << ans << endl;
return 0;
} | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 853,835 | 853,836 | u118846704 | cpp |
p03038 | #include <bits/stdc++.h>
struct Node {
int value;
int cnt;
bool operator<(const Node &rhs) const { return value > rhs.value; }
};
const int maxn = 2e5 + 10;
int n, m;
long long sum;
Node p[maxn];
int main() {
std::cin >> n >> m;
for (int i = 1; i <= n; i++)
std::cin >> p[i].value, p[i].cnt = 1;
for (int i = 1; i <= m; i++)
std::cin >> p[i + n].cnt >> p[i + n].value;
std::sort(p + 1, p + 1 + n + m);
for (int i = 1;; i++) {
if (p[i].cnt >= n) {
sum += n * p[i].value;
break;
} else {
sum += p[i].cnt * p[i].value;
n -= p[i].cnt;
}
}
std::cout << sum << '\n';
return 0;
}
| #include <bits/stdc++.h>
struct Node {
int value;
int cnt;
bool operator<(const Node &rhs) const { return value > rhs.value; }
};
const int maxn = 2e5 + 10;
int n, m;
long long sum;
Node p[maxn];
int main() {
std::cin >> n >> m;
for (int i = 1; i <= n; i++)
std::cin >> p[i].value, p[i].cnt = 1;
for (int i = 1; i <= m; i++)
std::cin >> p[i + n].cnt >> p[i + n].value;
std::sort(p + 1, p + 1 + n + m);
for (int i = 1;; i++) {
if (p[i].cnt >= n) {
sum += 1LL * n * p[i].value;
break;
} else {
sum += 1LL * p[i].cnt * p[i].value;
n -= p[i].cnt;
}
}
std::cout << sum << '\n';
return 0;
}
| [
"assignment.change"
] | 853,839 | 853,840 | u578930989 | cpp |
p03038 | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fu(i, r, t) for (int i = r; i <= t; i++)
#define fd(i, r, t) for (int i = r; i >= t; i--)
#define Set set<int>
#define int long long
#define P pair<int, int>
const int maxn = 1e6;
const int INF = 1e18 + 6;
using namespace std;
int n, m, a[maxn], b[maxn], c[maxn];
// bool operator<(const P& a, const P& b) {
// return a.parameter<b.parameter;
//}
priority_queue<P> T;
int32_t main() {
IOS;
cin >> n >> m;
int sum = 0;
fu(i, 1, n) {
cin >> a[i];
sum += a[i];
}
sort(a + 1, a + n + 1);
fu(i, 1, m) {
cin >> b[i] >> c[i];
T.push({c[i], b[i]});
}
int zuo = 0;
int key = 0;
while (!T.empty()) {
auto h = T.top();
T.pop();
int C = h.first;
int B = h.second;
fu(i, 1, B) {
if (a[++zuo] < C) {
sum += C - a[zuo];
} else {
key = 1;
break;
}
}
if (key)
break;
}
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define fu(i, r, t) for (int i = r; i <= t; i++)
#define fd(i, r, t) for (int i = r; i >= t; i--)
#define Set set<int>
#define int long long
#define P pair<int, int>
const int maxn = 1e6;
const int INF = 1e18 + 6;
using namespace std;
int n, m, a[maxn], b[maxn], c[maxn];
// bool operator<(const P& a, const P& b) {
// return a.parameter<b.parameter;
//}
priority_queue<P> T;
int32_t main() {
IOS;
cin >> n >> m;
int sum = 0;
fu(i, 1, n) {
cin >> a[i];
sum += a[i];
}
sort(a + 1, a + n + 1);
fu(i, 1, m) {
cin >> b[i] >> c[i];
T.push({c[i], b[i]});
}
int zuo = 0;
int key = 0;
while (!T.empty()) {
auto h = T.top();
T.pop();
int C = h.first;
int B = h.second;
fu(i, 1, B) {
if (a[++zuo] < C && zuo <= n) {
sum += C - a[zuo];
} else {
key = 1;
break;
}
}
if (key)
break;
}
cout << sum;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 853,843 | 853,844 | u020160935 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e16
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes" << endl;
#define all(a) a.begin(), a.end()
#define P pair<ll, ll>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない
// UnionFind
const int maxn = 100000;
int main() {
ll n, m;
vector<ll> a;
ll ans = 0;
vector<P> v;
cin >> n >> m;
rep(i, n) {
ll t;
cin >> t;
a.push_back(t);
}
rep(i, m) {
P p;
cin >> p.second >> p.first;
v.push_back(p);
}
sort(all(a));
sort(all(v));
reverse(all(v));
// cout << a[0]<<' '<<v[0].first<<endl;
int ite = 0;
bool key = false;
rep(i, m) {
rep(j, v[i].second) {
if (a[ite] <= v[i].first) {
ans += v[i].first;
} else {
key = true;
break;
}
ite++;
}
if (key || i == m - 1) {
for (int k = ite; k < n; k++) {
ans += a[k];
}
break;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e16
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define Yes cout << "Yes" << endl;
#define all(a) a.begin(), a.end()
#define P pair<ll, ll>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
//(int)'a'は97 (int)'A'は65 (int)'1'は49
//おまじない
// UnionFind
const int maxn = 100000;
int main() {
ll n, m;
vector<ll> a;
ll ans = 0;
vector<P> v;
cin >> n >> m;
rep(i, n) {
ll t;
cin >> t;
a.push_back(t);
}
rep(i, m) {
P p;
cin >> p.second >> p.first;
v.push_back(p);
}
sort(all(a));
sort(all(v));
reverse(all(v));
int ite = 0;
bool key = false;
rep(i, m) {
rep(j, v[i].second) {
if (ite < n && a[ite] < v[i].first) {
ans += v[i].first;
} else {
key = true;
break;
}
ite++;
}
if (key || i == m - 1) {
for (int k = ite; k < n; k++) {
ans += a[k];
}
break;
}
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 853,847 | 853,848 | u297203024 | cpp |
p03038 | #include <algorithm>
#include <cctype>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<string,string> P;
// double dat[100][100];
// int dp[6][1010];//動的計画法
// int prime[100001];
// char str[1010][1010];
// typedef pair<ll,ll> A;
// vector<A> pc;
// int ABS(int a){return max(a,-a);}
int main() {
struct chan {
int b;
ll c;
};
int n, m;
cin >> n >> m;
ll a[n];
vector<chan> key(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
int p;
ll q;
cin >> p >> q;
key[i].b = p;
key[i].c = q;
}
sort(key.begin(), key.end(),
[](const chan &x, const chan &y) { return x.c < y.c; });
int tmp = m - 1, ro = 0;
for (int i = 0; i < n; i++) {
if (tmp == 0)
break;
if (a[i] >= key[tmp].c) {
tmp--;
ro = 0;
continue;
} else {
a[i] = key[tmp].c;
}
ro++;
if (ro == key[tmp].b) {
tmp--;
ro = 0;
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += a[i];
// cout<<a[i];
}
// cout<<endl;
cout << ans;
return 0;
} | #include <algorithm>
#include <cctype>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
// typedef pair<string,string> P;
// double dat[100][100];
// int dp[6][1010];//動的計画法
// int prime[100001];
// char str[1010][1010];
// typedef pair<ll,ll> A;
// vector<A> pc;
// int ABS(int a){return max(a,-a);}
int main() {
struct chan {
int b;
ll c;
};
int n, m;
cin >> n >> m;
ll a[n];
vector<chan> key(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
int p;
ll q;
cin >> p >> q;
key[i].b = p;
key[i].c = q;
}
sort(key.begin(), key.end(),
[](const chan &x, const chan &y) { return x.c < y.c; });
int tmp = m - 1, ro = 0;
for (int i = 0; i < n; i++) {
if (tmp == -1)
break;
if (a[i] >= key[tmp].c) {
tmp--;
ro = 0;
continue;
} else {
a[i] = key[tmp].c;
}
ro++;
if (ro == key[tmp].b) {
tmp--;
ro = 0;
}
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += a[i];
// cout<<a[i]<<endl;
}
// cout<<endl;
cout << ans;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 853,859 | 853,860 | u559645647 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = 1050000000;
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define Tof(x) (x) ? Yes : No
#define TOF(x) (x) ? YES : NO
#define tof(x) (x) ? yes : no
using ll = long long;
/*vectorの要素を全部確認するやつだよ。
for (vector<int>::iterator itr = ans.begin(); itr != ans.end(); ++itr) {
cout << *itr << " ";
}
*/
/*for文でx,yを上下左右確認するやつだよ。
int dy[] = { 0, 1, 0, -1 };
int dx[] = { 1, 0, -1, 0 };
for (int i = 0; i < 4; i++) {
int ny = y + dy[i];
int nx = x + dx[i];
}
*/
/*繰り返し二乗法だよ。modもとってくれるよ。n^kをmodで割った余りでやってくれるよ。
ll POW_MOD(ll n, ll k, ll mod) {
ll r = 1;
for (; k > 0; k >>= 1) {
if (k & 1) {
r = (r * n) % mod;
}
n = (n * n) % mod;
}
return r;
}
*/
/*2重for文書くのめんどくなった時用だよ。
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
}
}
*/
int main(void) {
int n, m;
cin >> n >> m;
int a[100005];
int b, c;
ll ans = 0;
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]] += 1;
}
for (int i = 0; i < m; i++) {
cin >> b >> c;
mp[c] += b;
}
for (std::map<int, int>::reverse_iterator i = mp.rbegin(); i != mp.rend();
++i) {
if (n - (i->second) > 0) {
ans += (i->first) * (i->second);
n -= i->second;
} else {
ans += (n) * (i->first);
break;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = 1050000000;
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define Tof(x) (x) ? Yes : No
#define TOF(x) (x) ? YES : NO
#define tof(x) (x) ? yes : no
using ll = long long;
/*vectorの要素を全部確認するやつだよ。
for (vector<int>::iterator itr = ans.begin(); itr != ans.end(); ++itr) {
cout << *itr << " ";
}
*/
/*for文でx,yを上下左右確認するやつだよ。
int dy[] = { 0, 1, 0, -1 };
int dx[] = { 1, 0, -1, 0 };
for (int i = 0; i < 4; i++) {
int ny = y + dy[i];
int nx = x + dx[i];
}
*/
/*繰り返し二乗法だよ。modもとってくれるよ。n^kをmodで割った余りでやってくれるよ。
ll POW_MOD(ll n, ll k, ll mod) {
ll r = 1;
for (; k > 0; k >>= 1) {
if (k & 1) {
r = (r * n) % mod;
}
n = (n * n) % mod;
}
return r;
}
*/
/*2重for文書くのめんどくなった時用だよ。
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
}
}
*/
int main(void) {
int n, m;
cin >> n >> m;
ll a[100005];
ll b, c;
ll ans = 0;
map<ll, ll> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]] += 1;
}
for (int i = 0; i < m; i++) {
cin >> b >> c;
mp[c] += b;
}
for (std::map<ll, ll>::reverse_iterator i = mp.rbegin(); i != mp.rend();
++i) {
if (n - (i->second) > 0) {
ans += (i->first) * (i->second);
n -= i->second;
} else {
ans += (n) * (i->first);
break;
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 853,865 | 853,866 | u385617244 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
std::cin >> n >> m;
std::vector<long> a(n);
std::vector<pair<long, long>> b(m);
for (int i = 0; i < n; i++) {
/* code */
std::cin >> a[i];
}
for (int i = 0; i < m; i++) {
/* code */
std::cin >> b[i].second >> b[i].first;
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
int scope = 0;
for (int i = m - 1; i >= 0; i--) {
/* code */
for (int j = 0; j < b[i].second; j++) {
/* code */
if (a[scope] <= b[i].first) {
a[scope] = b[i].first;
scope++;
} else {
goto owari;
}
}
}
owari:
std::cout << accumulate(a.begin(), a.end(), 0) << std::endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
std::cin >> n >> m;
std::vector<long> a(n);
std::vector<pair<long, long>> b(m);
for (int i = 0; i < n; i++) {
/* code */
std::cin >> a[i];
}
for (int i = 0; i < m; i++) {
/* code */
std::cin >> b[i].second >> b[i].first;
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
int scope = 0;
for (int i = m - 1; i >= 0; i--) {
/* code */
for (int j = 0; j < b[i].second; j++) {
/* code */
if (a[scope] <= b[i].first) {
a[scope] = b[i].first;
scope++;
} else {
goto owari;
}
}
}
owari:
std::cout << accumulate(a.begin(), a.end(), 0LL) << std::endl;
} | [
"literal.number.type.widen.change"
] | 853,870 | 853,871 | u539011156 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a[100002], s[100002];
struct cz {
int b, c;
} z[100002];
bool cmp(cz x, cz y) { return x.c > y.c; }
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
int r = 0;
for (int i = 1; i <= m; i++) {
cin >> z[i].b >> z[i].c;
}
sort(z + 1, z + m + 1, cmp);
for (int i = 1; i <= m; i++) {
while (z[i].b > 0 && r < n) {
s[++r] = z[i].c;
z[i].b--;
}
}
int ans = 0;
for (int i = 1; i <= n; i++)
ans += max(a[i], s[i]);
cout << ans;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int a[100002], s[100002];
struct cz {
int b, c;
} z[100002];
bool cmp(cz x, cz y) { return x.c > y.c; }
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
int r = 0;
for (int i = 1; i <= m; i++) {
cin >> z[i].b >> z[i].c;
}
sort(z + 1, z + m + 1, cmp);
for (int i = 1; i <= m; i++) {
while (z[i].b > 0 && r < n) {
s[++r] = z[i].c;
z[i].b--;
}
}
long long ans = 0;
for (int i = 1; i <= n; i++)
ans += max(a[i], s[i]);
cout << ans;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,872 | 853,873 | u350561505 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> a;
std::vector<std::pair<int, int>> bc;
for (int i = 0; i < n; i++) {
int temp;
std::cin >> temp;
a.push_back(temp);
}
for (int i = 0; i < m; i++) {
int b, c;
std::cin >> b >> c;
bc.emplace_back(std::make_pair(b, c));
}
std::sort(a.begin(), a.end());
std::sort(bc.begin(), bc.end(),
[](const std::pair<int, int> &a, const std::pair<int, int> &b) {
return (a.second < b.second);
});
int ans = 0;
for (int i = n - 1, j = m - 1, sum = 0; sum < n; sum++) {
if (j >= 0 && a[i] < bc[j].second) {
ans += bc[j].second;
bc[j].first--;
if (bc[j].first == 0) {
j--;
}
} else {
ans += a[i--];
}
}
std::cout << ans << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> a;
std::vector<std::pair<int, int>> bc;
for (int i = 0; i < n; i++) {
int temp;
std::cin >> temp;
a.push_back(temp);
}
for (int i = 0; i < m; i++) {
int b, c;
std::cin >> b >> c;
bc.emplace_back(std::make_pair(b, c));
}
std::sort(a.begin(), a.end());
std::sort(bc.begin(), bc.end(),
[](const std::pair<int, int> &a, const std::pair<int, int> &b) {
return (a.second < b.second);
});
long long ans = 0;
for (int i = n - 1, j = m - 1, sum = 0; sum < n; sum++) {
if (j >= 0 && a[i] < bc[j].second) {
ans += bc[j].second;
bc[j].first--;
if (bc[j].first == 0) {
j--;
}
} else {
ans += a[i--];
}
}
std::cout << ans << std::endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,880 | 853,881 | u647903912 | cpp |
p03038 | #pragma region include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#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 MOD 1000000007
#define INF 1000000000
#define LLINF 4000000000000000000
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#pragma endregion
//#define __DEBUG__
#ifdef __DEBUG__
#define dump(x) \
cerr << #x << " = " << (x) << " [" << __LINE__ << ":" << __FUNCTION__ \
<< "] " << endl;
// vector出力
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
REP(i, (int)v.size()) { os << v[i] << (i < v.size() - 1 ? ", " : ""); }
os << "}";
return os;
}
// pair出力
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
// map出力
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
os << "(" << itr->first << ", " << itr->second << ")";
itr++;
if (itr != map_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
// set 出力
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr;
++itr;
if (itr != set_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
#endif
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, cnt = 0;
cin >> N >> M;
VI A(N);
REP(i, N) { cin >> A[i]; }
vector<PII> BC(M);
REP(i, M) { cin >> BC[i].second >> BC[i].first; }
A.emplace_back(-INF);
BC.emplace_back(PII(-INF, 0));
sort(ALL(BC), greater<PII>());
sort(ALL(A), greater<int>());
ll ans = 0;
int i = 0, j = 0;
while (cnt < N) {
if (A[i] >= BC[j].first) {
ans += A[i];
cnt++;
i++;
} else {
if (cnt + BC[j].second <= N) {
ans += BC[j].first * BC[j].second;
cnt += BC[j].second;
} else {
ans += BC[j].first * (N - cnt);
cnt = N;
}
j++;
}
}
cout << ans << endl;
getchar();
getchar();
} | #pragma region include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#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 MOD 1000000007
#define INF 1000000000
#define LLINF 4000000000000000000
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#pragma endregion
//#define __DEBUG__
#ifdef __DEBUG__
#define dump(x) \
cerr << #x << " = " << (x) << " [" << __LINE__ << ":" << __FUNCTION__ \
<< "] " << endl;
// vector出力
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
REP(i, (int)v.size()) { os << v[i] << (i < v.size() - 1 ? ", " : ""); }
os << "}";
return os;
}
// pair出力
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
// map出力
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
os << "{";
for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
os << "(" << itr->first << ", " << itr->second << ")";
itr++;
if (itr != map_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
// set 出力
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
os << "{";
for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr;
++itr;
if (itr != set_var.end())
os << ", ";
itr--;
}
os << "}";
return os;
}
#endif
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M, cnt = 0;
cin >> N >> M;
VI A(N);
REP(i, N) { cin >> A[i]; }
vector<PII> BC(M);
REP(i, M) { cin >> BC[i].second >> BC[i].first; }
A.emplace_back(-INF);
BC.emplace_back(PII(-INF, 0));
sort(ALL(BC), greater<PII>());
sort(ALL(A), greater<int>());
ll ans = 0;
int i = 0, j = 0;
while (cnt < N) {
if (A[i] >= BC[j].first) {
ans += A[i];
cnt++;
i++;
} else {
if (cnt + BC[j].second <= N) {
ans += (ll)BC[j].first * BC[j].second;
cnt += BC[j].second;
} else {
ans += (ll)BC[j].first * (N - cnt);
cnt = N;
}
j++;
}
}
cout << ans << endl;
getchar();
getchar();
} | [
"type_conversion.add"
] | 853,884 | 853,885 | u435935167 | cpp |
p03038 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
map<int, int> mp;
priority_queue<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
mp[a]++;
}
for (int i = 0; i < m; ++i) {
int b, c;
cin >> b >> c;
v.emplace(c, b);
}
pair<int, int> p = v.top();
v.pop();
for (auto &e : mp) {
if (e.first >= p.first)
break;
if (e.second < p.second) {
mp[p.first] += e.second;
p.second -= e.second;
e.second = 0;
} else {
while (e.second >= p.second) {
if (e.first >= p.first)
break;
mp[p.first] += p.second;
e.second -= p.second;
p.second = 0;
if (v.empty())
break;
p = v.top();
v.pop();
}
if (e.second > 0 && p.second > 0 && e.first < p.first) {
mp[p.first] += e.second;
p.second -= e.second;
e.second = 0;
}
}
if (p.second == 0 && v.empty())
break;
}
ll ans = 0;
for (auto &e : mp) {
ans += e.first * e.second;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
int main() {
int n, m;
cin >> n >> m;
map<ll, ll> mp;
priority_queue<pair<ll, ll>> v;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
mp[a]++;
}
for (int i = 0; i < m; ++i) {
int b, c;
cin >> b >> c;
v.emplace(c, b);
}
pair<int, int> p = v.top();
v.pop();
for (auto &e : mp) {
if (e.first >= p.first)
break;
if (e.second < p.second) {
mp[p.first] += e.second;
p.second -= e.second;
e.second = 0;
} else {
while (e.second >= p.second) {
if (e.first >= p.first)
break;
mp[p.first] += p.second;
e.second -= p.second;
p.second = 0;
if (v.empty())
break;
p = v.top();
v.pop();
}
if (e.second > 0 && p.second > 0 && e.first < p.first) {
mp[p.first] += e.second;
p.second -= e.second;
e.second = 0;
}
}
if (p.second == 0 && v.empty())
break;
}
ll ans = 0;
for (auto &e : mp) {
ans += e.first * e.second;
}
cout << ans << endl;
return 0;
}
| [] | 853,890 | 853,891 | u054652697 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int64_t> A(N);
vector<int64_t> D;
struct map {
int b;
int64_t c;
};
vector<map> bc;
int64_t answer = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.at(i) = a;
}
sort(A.begin(), A.end());
for (int i = 0; i < M; i++) {
int b;
int64_t c;
cin >> b >> c;
bc.push_back({b, c});
}
sort(bc.begin(), bc.end(),
[](const map &x, const map &y) { return x.c < y.c; });
int count = 0;
bool flag = false;
for (auto i = bc.begin(); i != bc.end(); i++) {
for (int j = 0; j < i->b; j++) {
if (count == N) {
flag = true;
break;
}
D.push_back(i->c);
count++;
}
if (flag) {
break;
}
}
for (int i = 0; i < count; i++) {
if (A.at(i) >= D.at(i)) {
break;
}
A.at(i) = D.at(i);
}
for (int i = 0; i < N; i++) {
answer += A.at(i);
}
cout << answer << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int64_t> A(N);
vector<int64_t> D;
struct map {
int b;
int64_t c;
};
vector<map> bc;
int64_t answer = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A.at(i) = a;
}
sort(A.begin(), A.end());
for (int i = 0; i < M; i++) {
int b;
int64_t c;
cin >> b >> c;
bc.push_back({b, c});
}
sort(bc.begin(), bc.end(),
[](const map &x, const map &y) { return x.c > y.c; });
int count = 0;
bool flag = false;
for (auto i = bc.begin(); i != bc.end(); ++i) {
for (int j = 0; j < i->b; j++) {
if (count == N) {
flag = true;
break;
}
D.push_back(i->c);
count++;
}
if (flag) {
break;
}
}
for (int i = 0; i < count; i++) {
if (A.at(i) >= D.at(i)) {
break;
}
A.at(i) = D.at(i);
}
for (int i = 0; i < N; i++) {
answer += A.at(i);
}
cout << answer << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 853,894 | 853,895 | u412989489 | cpp |
p03038 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
// input
int n, m, a, b, c;
cin >> n >> m;
vector<pair<ll, int>> cb;
rep(i, n) {
cin >> a;
cb.push_back(make_pair(a, 1));
}
rep(i, m) {
cin >> b >> c;
cb[i] = make_pair(c, b);
}
sort(cb.begin(), cb.end(), greater<pair<ll, int>>());
// solve
ll ans = 0;
rep(i, cb.size()) {
if (n > cb[i].second) {
ans += cb[i].first * cb[i].second;
n -= cb[i].second;
if (n == 0)
break;
} else {
ans += cb[i].first * n;
break;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
// input
int n, m, a, b, c;
cin >> n >> m;
vector<pair<ll, int>> cb;
rep(i, n) {
cin >> a;
cb.push_back(make_pair(a, 1));
}
rep(i, m) {
cin >> b >> c;
cb.push_back(make_pair(c, b));
}
sort(cb.begin(), cb.end(), greater<pair<ll, int>>());
// solve
ll ans = 0;
rep(i, cb.size()) {
if (n > cb[i].second) {
ans += cb[i].first * cb[i].second;
n -= cb[i].second;
if (n == 0)
break;
} else {
ans += cb[i].first * n;
break;
}
}
cout << ans << endl;
} | [
"call.arguments.change"
] | 853,904 | 853,905 | u658655325 | cpp |
p03038 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; --i)
#define REPC(i, obj) for (auto i : obj)
#define ALL(obj) (obj).begin(), (obj).end()
#define SETP(n) cout << fixed << setprecision(n)
#define VV(T, h, w) vector<vector<T>>(h, vector<T>(w))
#define VVI(T, h, w, i) vector<vector<T>>(h, vector<T>(w, i))
using namespace std;
using ll = unsigned long long;
template <typename T = ll> inline T in() {
T ret;
cin >> ret;
return ret;
}
int main() {
ll n = in(), m = in();
vector<ll> a(n);
REP(i, n) scanf("%lld", &a[i]);
sort(ALL(a));
vector<pair<ll, ll>> bc(m);
REP(i, m) {
ll b, c;
scanf("%lld%lld", &b, &c);
bc[i] = make_pair(c, b);
}
sort(ALL(bc), greater<pair<ll, ll>>());
ll inow = 0, ans = 0;
REP(i, m) {
ll b = bc[i].second, c = bc[i].first;
for (ll j = 0; j < min(b, n - inow); ++j) {
ans += max(a[j + inow], c);
}
inow += b;
}
for (ll j = inow; j < n; ++j)
ans += a[j];
cout << ans << endl;
} | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define INF 1e9
#define INFLL 1e18
#define EPS 1e-9
#define MOD 1000000007
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define REPR(i, n) for (ll i = (n)-1; i >= 0; --i)
#define REPR1(i, n) for (ll i = (n); i > 0; --i)
#define REPC(i, obj) for (auto i : obj)
#define ALL(obj) (obj).begin(), (obj).end()
#define SETP(n) cout << fixed << setprecision(n)
#define VV(T, h, w) vector<vector<T>>(h, vector<T>(w))
#define VVI(T, h, w, i) vector<vector<T>>(h, vector<T>(w, i))
using namespace std;
using ll = long long;
template <typename T = ll> inline T in() {
T ret;
cin >> ret;
return ret;
}
int main() {
ll n = in(), m = in();
vector<ll> a(n);
REP(i, n) scanf("%lld", &a[i]);
sort(ALL(a));
vector<pair<ll, ll>> bc(m);
REP(i, m) {
ll b, c;
scanf("%lld%lld", &b, &c);
bc[i] = make_pair(c, b);
}
sort(ALL(bc), greater<pair<ll, ll>>());
ll inow = 0, ans = 0;
REP(i, m) {
ll b = bc[i].second, c = bc[i].first;
for (ll j = 0; j < min(b, n - inow); ++j) {
ans += max(a[j + inow], c);
}
inow += b;
}
for (ll j = inow; j < n; ++j)
ans += a[j];
cout << ans << endl;
} | [
"variable_declaration.type.narrow.change"
] | 853,906 | 853,907 | u388817534 | cpp |
p03038 | #include <algorithm>
#include <stdio.h>
int main() {
int N, M;
scanf("%d %d", &N, &M);
int *a = new int[N];
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
int *b = new int[M];
int *c = new int[M];
for (int i = 0; i < M; i++) {
scanf("%d %d", &b[i], &c[i]);
}
int *max = new int[N];
std::pair<int, int> *ac = new std::pair<int, int>[N + M];
for (int i = 0; i < N; i++) {
ac[i] = std::pair<int, int>(a[i], 1);
}
for (int i = N; i < N + M; i++) {
ac[i] = std::pair<int, int>(c[i - N], b[i - N]);
}
sort(ac, ac + N + M);
int res = 0;
int cnt = 0;
for (int i = N + M - 1; i >= 0; i--) {
for (int j = 0; j < ac[i].second; j++) {
res += ac[i].first;
cnt++;
if (cnt == N) {
printf("%lld", res);
// Sleep(10000);
return 0;
}
}
}
} | #include <algorithm>
#include <stdio.h>
int main() {
int N, M;
scanf("%d %d", &N, &M);
int *a = new int[N];
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
int *b = new int[M];
int *c = new int[M];
for (int i = 0; i < M; i++) {
scanf("%d %d", &b[i], &c[i]);
}
int *max = new int[N];
std::pair<int, int> *ac = new std::pair<int, int>[N + M];
for (int i = 0; i < N; i++) {
ac[i] = std::pair<int, int>(a[i], 1);
}
for (int i = N; i < N + M; i++) {
ac[i] = std::pair<int, int>(c[i - N], b[i - N]);
}
sort(ac, ac + N + M);
long long res = 0;
int cnt = 0;
for (int i = N + M - 1; i >= 0; i--) {
for (int j = 0; j < ac[i].second; j++) {
res += ac[i].first;
cnt++;
if (cnt == N) {
printf("%lld", res);
// Sleep(10000);
return 0;
}
}
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,910 | 853,911 | u617987447 | cpp |
p03038 | #include <algorithm>
#include <stdio.h>
int main() {
int N, M;
scanf("%d %d", &N, &M);
int *a = new int[N];
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
int *b = new int[M];
int *c = new int[M];
for (int i = 0; i < M; i++) {
scanf("%d %d", &b[i], &c[i]);
}
int *max = new int[N];
std::pair<int, int> *ac = new std::pair<int, int>[N + M];
for (int i = 0; i < N; i++) {
ac[i] = std::pair<int, int>(a[i], 1);
}
for (int i = N; i < N + M; i++) {
ac[i] = std::pair<int, int>(c[i - N], b[i - N]);
}
sort(ac, ac + N + M);
int res = 0;
int cnt = 0;
for (int i = N + M - 1; i >= 0; i--) {
for (int j = 0; j < ac[i].second; j++) {
res += ac[i].first;
cnt++;
if (cnt == N) {
printf("%d", res);
// Sleep(10000);
return 0;
}
}
}
} | #include <algorithm>
#include <stdio.h>
int main() {
int N, M;
scanf("%d %d", &N, &M);
int *a = new int[N];
for (int i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
int *b = new int[M];
int *c = new int[M];
for (int i = 0; i < M; i++) {
scanf("%d %d", &b[i], &c[i]);
}
int *max = new int[N];
std::pair<int, int> *ac = new std::pair<int, int>[N + M];
for (int i = 0; i < N; i++) {
ac[i] = std::pair<int, int>(a[i], 1);
}
for (int i = N; i < N + M; i++) {
ac[i] = std::pair<int, int>(c[i - N], b[i - N]);
}
sort(ac, ac + N + M);
long long res = 0;
int cnt = 0;
for (int i = N + M - 1; i >= 0; i--) {
for (int j = 0; j < ac[i].second; j++) {
res += ac[i].first;
cnt++;
if (cnt == N) {
printf("%lld", res);
// Sleep(10000);
return 0;
}
}
}
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 853,912 | 853,911 | u617987447 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int n, m, u = 0, p = 0;
long long ans = 0;
cin >> n >> m;
vector<long> a(n);
vector<pair<long, int>> b(m);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < m; i++) {
cin >> b.at(i).second >> b.at(i).first;
}
sort(b.begin(), b.end());
reverse(b.begin(), b.end());
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
while (true) {
if (p == m || a.at(n - u - 1) >= b.at(p).first) {
for (int i = 0; i < n - u; i++) {
ans = ans + a.at(i);
}
break;
}
if (n - u - b.at(p).second > 0) {
if (b.at(p).first >= a.at(n - u - 1 - b.at(p).second)) {
ans = ans + b.at(p).first * b.at(p).second;
u = u + b.at(p).second;
} else {
for (int i = 0; i < b.at(p).second; i++) {
if (b.at(p).first >= a.at(n - u - 1)) {
ans = ans + b.at(p).first;
u++;
} else
break;
}
}
} else {
if (b.at(p).first >= a.at(0))
ans = ans + b.at(p).first * (n - u);
else {
for (int i = 0; i < b.at(p).second; i++) {
if (b.at(p).first >= a.at(n - u - 1) && u < n)
ans = ans + b.at(p).first;
else
break;
u++;
}
}
}
p++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
// Your code here!
int n, m, u = 0, p = 0;
long long ans = 0;
cin >> n >> m;
vector<long> a(n);
vector<pair<long, int>> b(m);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
for (int i = 0; i < m; i++) {
cin >> b.at(i).second >> b.at(i).first;
}
sort(b.begin(), b.end());
reverse(b.begin(), b.end());
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
while (true) {
if (p == m || a.at(n - u - 1) >= b.at(p).first) {
for (int i = 0; i < n - u; i++) {
ans = ans + a.at(i);
}
break;
}
if (n - u - b.at(p).second > 0) {
if (b.at(p).first >= a.at(n - u - 1 - b.at(p).second)) {
ans = ans + b.at(p).first * b.at(p).second;
u = u + b.at(p).second;
} else {
for (int i = 0; i < b.at(p).second; i++) {
if (b.at(p).first >= a.at(n - u - 1)) {
ans = ans + b.at(p).first;
u++;
} else
break;
}
}
} else {
if (b.at(p).first >= a.at(0)) {
ans = ans + b.at(p).first * (n - u);
break;
} else {
for (int i = 0; i < b.at(p).second; i++) {
if (b.at(p).first >= a.at(n - u - 1) && u < n)
ans = ans + b.at(p).first;
else
break;
u++;
}
}
}
p++;
}
cout << ans << endl;
} | [
"control_flow.break.add"
] | 853,913 | 853,914 | u112775098 | cpp |
p03038 | #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n, m;
cin >> n >> m;
vector<pair<long, long>> ps;
for (int i = 0; i < n; i++) {
long a;
ps.push_back({a, 1});
}
while (m--) {
long b, c;
cin >> b >> c;
ps.push_back({c, b});
}
sort(ps.rbegin(), ps.rend());
long ans = 0, cnt = n;
auto it = ps.begin();
while (cnt && it != ps.end()) {
long res = min(cnt, it->second);
ans += res * it->first;
cnt -= res;
it++;
}
cout << ans << endl;
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
void solve(void) {
int n, m;
cin >> n >> m;
vector<pair<long, long>> ps;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
ps.push_back({a, 1});
}
while (m--) {
long b, c;
cin >> b >> c;
ps.push_back({c, b});
}
sort(ps.rbegin(), ps.rend());
long ans = 0, cnt = n;
auto it = ps.begin();
while (cnt && it != ps.end()) {
long res = min(cnt, it->second);
ans += res * it->first;
cnt -= res;
it++;
}
cout << ans << endl;
}
int main() {
solve();
// cout << "yui(*-v・)yui" << endl;
return 0;
}
| [] | 853,933 | 853,934 | u344412812 | cpp |
p03038 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
ll A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + sizeof(A) / sizeof(ll));
pair<ll, ll> v[M];
ll temp1, temp2;
for (int i = 0; i < M; i++) {
cin >> temp1;
cin >> temp2;
// cout << "!";
v[i].first = temp2;
v[i].second = temp1;
// cout << "!";
}
sort(v, v + sizeof(v) / sizeof(pair<ll, ll>));
ll anscard = 0, donecard = 0, doneope = 0, ans = 0;
while (anscard < N && doneope < M) {
if (A[N - 1 - donecard] >= v[M - 1 - doneope].first) {
ans += A[N - 1 - donecard];
donecard++;
anscard++;
// cout << ans << " " << anscard << endl;
} else {
ans += v[M - 1 - doneope].first *
min(v[M - 1 - doneope].second, N - anscard);
anscard += min(v[M - 1 - doneope].second, N - anscard);
doneope++;
// cout << ans << " " << anscard << endl;
}
}
for (; anscard < N; anscard++) {
ans += A[N - 1 - donecard];
donecard++;
anscard++;
}
cout << ans;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
ll A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A, A + sizeof(A) / sizeof(ll));
pair<ll, ll> v[M];
ll temp1, temp2;
for (int i = 0; i < M; i++) {
cin >> temp1;
cin >> temp2;
// cout << "!";
v[i].first = temp2;
v[i].second = temp1;
// cout << "!";
}
sort(v, v + sizeof(v) / sizeof(pair<ll, ll>));
ll anscard = 0, donecard = 0, doneope = 0, ans = 0;
while (anscard < N && doneope < M) {
if (A[N - 1 - donecard] >= v[M - 1 - doneope].first) {
ans += A[N - 1 - donecard];
donecard++;
anscard++;
// cout << ans << " " << anscard << endl;
} else {
ans += v[M - 1 - doneope].first *
min(v[M - 1 - doneope].second, N - anscard);
anscard += min(v[M - 1 - doneope].second, N - anscard);
doneope++;
// cout << ans << " " << anscard << endl;
}
}
for (; anscard < N; anscard++) {
ans += A[N - 1 - donecard];
donecard++;
}
cout << ans;
} | [
"expression.unary.arithmetic.remove"
] | 853,952 | 853,953 | u778347695 | cpp |
p03038 | #include <bits/stdc++.h>
#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL = (LL)1e19;
const int MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n), b(m), c(m);
REP(i, n) cin >> a[i];
REP(i, m) cin >> b[i] >> c[i];
vector<P> p;
REP(i, m) { p.pb(make_pair(c[i], b[i])); }
sort(all(a));
sort(all(p), greater<P>());
vector<int> d(n);
for (int i = 0, j = 0; i < m && j < n; i++) {
while (p[i].second > 0) {
d[j] = p[i].first;
j++;
p[i].second--;
}
}
priority_queue<LL> que;
REP(i, n) que.push(a[i]);
REP(i, n) que.push(d[i]);
LL ans = 0;
REP(i, n) {
ans += que.top();
que.pop();
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
using LL = long long;
using P = pair<int, int>;
#define FOR(i, a, n) for (int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define pb(a) push_back(a)
#define all(x) (x).begin(), (x).end()
const int INF = (int)1e9;
const LL INFL = (LL)1e19;
const int MOD = 1e9 + 7;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n), b(m), c(m);
REP(i, n) cin >> a[i];
REP(i, m) cin >> b[i] >> c[i];
vector<P> p;
REP(i, m) { p.pb(make_pair(c[i], b[i])); }
sort(all(a));
sort(all(p), greater<P>());
vector<int> d(n);
for (int i = 0, j = 0; i < m && j < n; i++) {
while (p[i].second > 0 && j < n) {
d[j] = p[i].first;
j++;
p[i].second--;
}
}
priority_queue<LL> que;
REP(i, n) que.push(a[i]);
REP(i, n) que.push(d[i]);
LL ans = 0;
REP(i, n) {
ans += que.top();
que.pop();
}
cout << ans << endl;
} | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 853,954 | 853,955 | u544732702 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll count = 0;
ll N, M;
cin >> N >> M;
vector<ll> A(N);
vector<pair<ll, ll>> vec(M, pair<ll, ll>());
for (ll i = 0; i < N; i++)
cin >> A.at(i);
for (ll i = 0; i < M; i++)
cin >> vec.at(i).second >> vec.at(i).first;
sort(A.begin(), A.end());
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
ll ite = 0;
for (ll i = 0; i < M; i++) {
for (ll j = ite; vec.at(i).second > 0; j++) {
if (A.at(j) < vec.at(i).first) {
A.at(j) = vec.at(i).first;
vec.at(i).second--;
ite++;
} else {
for (ll k = 0; k < N; k++)
count += A.at(k);
cout << count << endl;
return 0;
}
}
}
for (ll i = 0; i < N; i++)
count += A.at(i);
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll count = 0;
ll N, M;
cin >> N >> M;
vector<ll> A(N);
vector<pair<ll, ll>> vec(M, pair<ll, ll>());
for (ll i = 0; i < N; i++)
cin >> A.at(i);
for (ll i = 0; i < M; i++)
cin >> vec.at(i).second >> vec.at(i).first;
sort(A.begin(), A.end());
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
ll ite = 0;
for (ll i = 0; i < M; i++) {
for (ll j = ite; vec.at(i).second > 0 && j < N; j++) {
if (A.at(j) < vec.at(i).first) {
A.at(j) = vec.at(i).first;
vec.at(i).second--;
ite++;
} else {
for (ll k = 0; k < N; k++)
count += A.at(k);
cout << count << endl;
return 0;
}
}
}
for (ll i = 0; i < N; i++)
count += A.at(i);
cout << count << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 853,958 | 853,959 | u889812821 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll count = 0;
ll N, M;
cin >> N >> M;
vector<ll> A(N);
vector<pair<ll, ll>> vec(M, pair<ll, ll>());
for (ll i = 0; i < N; i++)
cin >> A.at(i);
for (ll i = 0; i < M; i++)
cin >> vec.at(i).second >> vec.at(i).first;
sort(A.begin(), A.end());
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
ll ite = 0;
for (ll i = 0; i < M; i++) {
for (ll j = ite; vec.at(i).second > 0; j++) {
if (A.at(j) < vec.at(i).first) {
A.at(j) = vec.at(i).first;
vec.at(i).second--;
ite++;
} else {
for (ll k = 0; k < N; k++)
count += A.at(k);
cout << count << endl;
return 0;
}
}
}
for (ll i = 0; i < N; i++)
count += A.at(i);
cout << count << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll count = 0;
ll N, M;
cin >> N >> M;
vector<ll> A(N);
vector<pair<ll, ll>> vec(M, pair<ll, ll>());
for (ll i = 0; i < N; i++)
cin >> A.at(i);
for (ll i = 0; i < M; i++)
cin >> vec.at(i).second >> vec.at(i).first;
sort(A.begin(), A.end());
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
ll ite = 0;
for (ll i = 0; i < M; i++) {
for (ll j = ite; vec.at(i).second > 0 && j < N; j++) {
if (A.at(j) < vec.at(i).first) {
A.at(j) = vec.at(i).first;
vec.at(i).second--;
ite++;
} else {
for (ll k = 0; k < N; k++)
count += A.at(k);
cout << count << endl;
return 0;
}
}
}
for (ll i = 0; i < N; i++)
count += A.at(i);
cout << count << endl;
}
| [
"control_flow.loop.for.condition.change"
] | 853,960 | 853,959 | u889812821 | cpp |
p03038 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (n); ++(i))
#define FOR(i, n) for (int i = 1; (i) <= (n); ++(i))
#define dump(x) cout << #x << " = " << (x) << endl;
#define pb push_back
#define int long long
//#define lint long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const lint LINF = 1e18;
const double eps = 0.000000001; //もとの値の10^(-16)まで
using namespace std;
int n, m;
int a[200000];
int c[200000];
vector<pair<int, int>> v;
signed main() {
cin >> n >> m;
REP(i, n) { cin >> a[i]; }
REP(i, m) {
int k1, k2;
cin >> k1 >> k2;
v.pb(pair<int, int>(k2, k1));
}
sort(a, a + n);
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
int t = -1; // made
int now = 0;
int ans = 0;
int k2;
REP(i, n) {
if (now == m) {
ans += a[i];
continue;
}
if (t < i) {
t += v[now].second;
k2 = v[now].first;
now++;
}
ans += max(a[i], k2);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (n); ++(i))
#define FOR(i, n) for (int i = 1; (i) <= (n); ++(i))
#define dump(x) cout << #x << " = " << (x) << endl;
#define pb push_back
#define int long long
//#define lint long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const lint LINF = 1e18;
const double eps = 0.000000001; //もとの値の10^(-16)まで
using namespace std;
int n, m;
int a[200000];
int c[200000];
vector<pair<int, int>> v;
signed main() {
cin >> n >> m;
REP(i, n) { cin >> a[i]; }
REP(i, m) {
int k1, k2;
cin >> k1 >> k2;
v.pb(pair<int, int>(k2, k1));
}
sort(a, a + n);
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
int t = -1; // made
int now = 0;
int ans = 0;
int k2;
REP(i, n) {
if (now == m && t < i) {
ans += a[i];
continue;
}
if (t < i) {
t += v[now].second;
k2 = v[now].first;
now++;
}
ans += max(a[i], k2);
}
cout << ans << endl;
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 853,961 | 853,962 | u697232864 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define INT(a) scanf("%d", &a)
#define STR(a) scanf("%s", a)
#define DBL(a) scanf("%lf", &a)
#define LNG(a) scanf("%lld", &a)
#define PI acos(-1)
#define ff first
#define ss second
int b[100005], c[100005];
int main() {
int n, m;
cin >> n >> m;
vector<int> num;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
num.push_back(a);
}
sort(num.begin(), num.end());
vector<pair<int, int>> query;
for (int i = 1; i <= m; i++) {
cin >> b[i] >> c[i];
query.push_back({c[i], b[i]});
}
sort(query.rbegin(), query.rend());
long long sum = 0, j = 0;
for (int i = 0; i < query.size(); i++) {
int val = query[i].ff;
int pos = lower_bound(num.begin(), num.end(), val) - num.begin();
if (pos >= j) {
int tmp = pos - j;
tmp = min(tmp, query[i].ss);
sum += tmp * val;
j += tmp;
}
}
sum = accumulate(num.begin() + j, num.end(), sum);
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INT(a) scanf("%d", &a)
#define STR(a) scanf("%s", a)
#define DBL(a) scanf("%lf", &a)
#define LNG(a) scanf("%lld", &a)
#define PI acos(-1)
#define ff first
#define ss second
int b[100005], c[100005];
int main() {
int n, m;
cin >> n >> m;
vector<int> num;
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
num.push_back(a);
}
sort(num.begin(), num.end());
vector<pair<int, int>> query;
for (int i = 1; i <= m; i++) {
cin >> b[i] >> c[i];
query.push_back({c[i], b[i]});
}
sort(query.rbegin(), query.rend());
long long sum = 0, j = 0;
for (int i = 0; i < query.size(); i++) {
long long val = query[i].ff;
int pos = lower_bound(num.begin(), num.end(), val) - num.begin();
if (pos >= j) {
int tmp = pos - j;
tmp = min(tmp, query[i].ss);
sum += tmp * val;
j += tmp;
}
}
sum = accumulate(num.begin() + j, num.end(), sum);
cout << sum << endl;
return 0;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 853,967 | 853,968 | u402651318 | cpp |
p03038 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
#define pie 3.141592653589793238462643383279
#define mod 1000000007
#define INF 1145141919364364
#define all(vec) vec.begin(), vec.end()
#define ggr \
getchar(); \
getchar(); \
return 0;
#define ll long long
#define P pair<int, int>
#define S second
#define F first
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
bool prime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0)
return false;
}
return true;
}
int kai(int x) {
if (x == 1)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int moder) {
int res = 1;
while (y > 0) {
if (y & 1)
res = res * x % moder;
x = x * x % moder;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
if (x == y)
return 1;
return kai(x) * mod_pow(kai(x - y), mod - 2, mod) % mod *
mod_pow(kai(y), mod - 2, mod) % mod;
}
int n, m, a[114514], b[114514], c[114514];
vector<pair<int, int>> ta;
int ans;
signed main() {
cin >> n >> m;
rep(i, n) cin >> a[i];
sort(a, a + n);
rep(i, m) {
cin >> b[i] >> c[i];
ta.push_back({c[i], b[i]});
}
sort(all(ta));
reverse(all(ta));
int k = 0;
rep(i, m) {
for (int j = k; j < k + ta[i].second; j++) {
if (j == n - 1)
break;
if (a[j] < ta[i].first)
a[j] = ta[i].first;
else
break;
}
k += ta[i].second;
}
rep(i, n) ans += a[i];
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
#define pie 3.141592653589793238462643383279
#define mod 1000000007
#define INF 1145141919364364
#define all(vec) vec.begin(), vec.end()
#define ggr \
getchar(); \
getchar(); \
return 0;
#define ll long long
#define P pair<int, int>
#define S second
#define F first
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
bool prime(int x) {
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0)
return false;
}
return true;
}
int kai(int x) {
if (x == 1)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int moder) {
int res = 1;
while (y > 0) {
if (y & 1)
res = res * x % moder;
x = x * x % moder;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
if (x == y)
return 1;
return kai(x) * mod_pow(kai(x - y), mod - 2, mod) % mod *
mod_pow(kai(y), mod - 2, mod) % mod;
}
int n, m, a[114514], b[114514], c[114514];
vector<pair<int, int>> ta;
int ans;
signed main() {
cin >> n >> m;
rep(i, n) cin >> a[i];
sort(a, a + n);
rep(i, m) {
cin >> b[i] >> c[i];
ta.push_back({c[i], b[i]});
}
sort(all(ta));
reverse(all(ta));
int k = 0;
rep(i, m) {
for (int j = k; j < k + ta[i].second; j++) {
if (j >= n)
break;
if (a[j] < ta[i].first)
a[j] = ta[i].first;
else
break;
}
k += ta[i].second;
}
rep(i, n) ans += a[i];
cout << ans << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 853,971 | 853,970 | u277153875 | cpp |
p03038 | // Bismillahir rahmanir rahim
#include <bits/stdc++.h>
#define ll long long
#define eps 0.000000001
using namespace std;
int arr[100005];
bool cmp(pair<ll, ll> a, pair<ll, ll> b) {
if (a.second < b.second)
return a.second > b.second;
if (a.second == b.second)
return a.first > b.first;
}
int main() { // freopen("in.txt","r",stdin);
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
ll n, m;
cin >> n >> m;
vector<ll> v;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
vector<pair<ll, ll>> p;
for (int i = 0; i < m; i++) {
ll b, c;
cin >> b >> c;
p.push_back({b, c});
}
sort(p.begin(), p.end(), cmp);
int j = 0;
for (int i = 0; i < p.size(); i++) {
while (p[i].first--) {
if (j == v.size())
break;
if (v[j] < p[i].second)
v[j++] = p[i].second;
else
break;
}
}
ll ans = 0;
for (int i = 0; i < v.size(); i++)
ans += v[i]; // cout<<v[i]<<" ";
cout << ans << endl;
}
| // Bismillahir rahmanir rahim
#include <bits/stdc++.h>
#define ll long long
#define eps 0.000000001
using namespace std;
int arr[100005];
bool cmp(pair<ll, ll> a, pair<ll, ll> b) {
if (a.second < b.second)
return a.second > b.second;
if (a.second == b.second)
return a.first > b.first;
else
return true;
}
int main() { // freopen("in.txt","r",stdin);
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
ll n, m;
cin >> n >> m;
vector<ll> v;
for (int i = 0; i < n; i++) {
ll x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
vector<pair<ll, ll>> p;
for (int i = 0; i < m; i++) {
ll b, c;
cin >> b >> c;
p.push_back({b, c});
}
sort(p.begin(), p.end(), cmp);
int j = 0;
for (int i = 0; i < p.size(); i++) {
while (p[i].first--) {
if (j == v.size())
break;
if (v[j] < p[i].second)
v[j++] = p[i].second;
else
break;
}
}
ll ans = 0;
for (int i = 0; i < v.size(); i++)
ans += v[i]; // cout<<v[i]<<" ";
cout << ans << endl;
}
| [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"control_flow.return.add"
] | 853,978 | 853,979 | u841576231 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long i64;
typedef pair<i64, i64> P;
i64 n, m, a[101010];
P p[101010];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> p[i].second >> p[i].first;
}
sort(p, p + m);
sort(a, a + n);
i64 ans = 0;
int checked = 0;
for (int i = m - 1; i >= 0; i--) {
if (checked + p[i].second > n) {
for (; checked < n; checked++) {
if (a[checked] >= p[i].first) {
break;
}
ans += a[checked];
}
break;
}
if (p[i].first < a[checked + p[i].second - 1]) {
while (a[checked] < p[i].first) {
ans += p[i].first;
checked++;
}
break;
}
ans += p[i].first * p[i].second;
checked += p[i].second;
}
for (int i = checked; i < n; i++) {
ans += a[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF 1000000000000000007
typedef long long i64;
typedef pair<i64, i64> P;
i64 n, m, a[101010];
P p[101010];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> p[i].second >> p[i].first;
}
sort(p, p + m);
sort(a, a + n);
i64 ans = 0;
int checked = 0;
for (int i = m - 1; i >= 0; i--) {
if (checked + p[i].second > n) {
for (; checked < n; checked++) {
if (a[checked] >= p[i].first) {
break;
}
ans += p[i].first;
}
break;
}
if (p[i].first < a[checked + p[i].second - 1]) {
while (a[checked] < p[i].first) {
ans += p[i].first;
checked++;
}
break;
}
ans += p[i].first * p[i].second;
checked += p[i].second;
}
for (int i = checked; i < n; i++) {
ans += a[i];
}
cout << ans << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 853,984 | 853,985 | u414947284 | cpp |
p03038 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mind(a, b) (a > b ? b : a)
#define maxd(a, b) (a > b ? a : b)
#define absd(x) (x < 0 ? -(x) : x)
#define pow2(x) ((x) * (x))
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define repl(i, s, n) for (int i = s; i <= n; ++i)
#define replr(i, s, n) for (int i = n; i >= s; --i)
#define repf(i, s, n, j) for (int i = s; i <= n; i += j)
#define repe(e, obj) for (auto e : obj)
#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X, Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i, n, val) \
for (int i = 0; i < n; ++i) \
cout << val << " "; \
cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9
typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define P_TYPE int
typedef pair<P_TYPE, P_TYPE> P;
typedef pair<P, P_TYPE> PI;
typedef pair<P_TYPE, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P>> pvqueue;
#define N 100003
ll n, m;
ll s;
int main() {
cin >> n >> m;
map<ll, ll> card;
s = 0;
rep(i, n) {
ll a;
cin >> a;
++card[a];
s += a;
}
rep(i, m) {
ll b, c;
cin >> b >> c;
auto it = card.begin();
ll rest = b;
ll cnt = 0;
while (rest > 0) {
if (c < (*it).first) {
break;
}
ll r = min(rest, (*it).second);
(*it).second -= r;
rest -= r;
s -= (*it).first * r;
cnt += r;
++it;
}
while (!card.empty() && (*card.begin()).second == 0) {
card.erase(card.begin());
}
if (cnt > 0) {
card[c] = cnt;
s += ((ll)c) * cnt;
}
}
cout << s << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mind(a, b) (a > b ? b : a)
#define maxd(a, b) (a > b ? a : b)
#define absd(x) (x < 0 ? -(x) : x)
#define pow2(x) ((x) * (x))
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; --i)
#define repl(i, s, n) for (int i = s; i <= n; ++i)
#define replr(i, s, n) for (int i = n; i >= s; --i)
#define repf(i, s, n, j) for (int i = s; i <= n; i += j)
#define repe(e, obj) for (auto e : obj)
#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X, Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i, n, val) \
for (int i = 0; i < n; ++i) \
cout << val << " "; \
cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9
typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define P_TYPE int
typedef pair<P_TYPE, P_TYPE> P;
typedef pair<P, P_TYPE> PI;
typedef pair<P_TYPE, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P>> pvqueue;
#define N 100003
ll n, m;
ll s;
int main() {
cin >> n >> m;
map<ll, ll> card;
s = 0;
rep(i, n) {
ll a;
cin >> a;
++card[a];
s += a;
}
rep(i, m) {
ll b, c;
cin >> b >> c;
auto it = card.begin();
ll rest = b;
ll cnt = 0;
while (rest > 0) {
if (c < (*it).first) {
break;
}
ll r = min(rest, (*it).second);
(*it).second -= r;
rest -= r;
s -= (*it).first * r;
cnt += r;
++it;
}
while (!card.empty() && (*card.begin()).second == 0) {
card.erase(card.begin());
}
if (cnt > 0) {
card[c] += cnt;
s += c * cnt;
}
}
cout << s << endl;
return 0;
} | [
"assignment.value.change"
] | 853,990 | 853,991 | u226155577 | cpp |
p03038 | /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> a(n);
vector<int> id(n);
vector<pair<ll, ll>> cb;
ll sum = 0;
fori(n) {
cin >> a[i];
sum += a[i];
id[i] = i;
}
fori(m) {
ll b, c;
cin >> b >> c;
cb.push_back({c, b});
}
sort(cb.begin(), cb.end());
sort(id.begin(), id.end(), [&](int i1, int i2) { return a[i1] < a[i2]; });
int nextCb = m - 1;
int nextA = 0;
while (nextCb >= 0) {
int d = cb[nextCb].first - a[id[nextA]];
if (d > 0) {
sum += d;
nextA++;
cb[nextCb].second--;
if (cb[nextCb].second == 0)
nextCb--;
} else
break;
}
cout << sum << endl;
}
| /**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
#define fori(n) for (ll i = 0; i < (n); i++)
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define forn3(i, x, n) for (ll i = (x); i < (n); i++)
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> a(n);
vector<int> id(n);
vector<pair<ll, ll>> cb;
ll sum = 0;
fori(n) {
cin >> a[i];
sum += a[i];
id[i] = i;
}
fori(m) {
ll b, c;
cin >> b >> c;
cb.push_back({c, b});
}
sort(cb.begin(), cb.end());
sort(id.begin(), id.end(), [&](int i1, int i2) { return a[i1] < a[i2]; });
int nextCb = m - 1;
int nextA = 0;
while (nextCb >= 0 && nextA < n) {
int d = cb[nextCb].first - a[id[nextA]];
if (d > 0) {
sum += d;
nextA++;
cb[nextCb].second--;
if (cb[nextCb].second == 0)
nextCb--;
} else
break;
}
cout << sum << endl;
}
| [
"control_flow.loop.condition.change"
] | 853,994 | 853,995 | u014617387 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
typedef pair<int, int> pii;
typedef pair<int, char> pic;
typedef priority_queue<pii, vector<pii>, greater<pii>> RPQ;
#define mk make_pair
#define INF (1 << 30)
#define INFL (1ll << 60ll)
#define mod 1000000007
int N, M;
int A[100100];
pii P[100100];
int ans;
signed main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
P[i] = mk(b, a);
}
sort(A, A + N, greater<int>());
sort(P, P + M, greater<pii>());
int j = 0;
for (int i = 0; i < M; i++) {
while (A[j] > P[i].first && j < N) {
ans += A[j];
j++;
}
if (N - j >= P[i].second) {
ans += P[i].first * P[i].second;
N -= P[i].second;
} else {
ans += (N - j) * P[i].first;
break;
}
}
if (N - j > 0) {
for (int i = j; i < N; i++) {
ans += A[i];
}
}
cout << ans << endl;
return 0;
}
/*
*/ | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
typedef pair<int, int> pii;
typedef pair<int, char> pic;
typedef priority_queue<pii, vector<pii>, greater<pii>> RPQ;
#define mk make_pair
#define INF (1 << 30)
#define INFL (1ll << 60ll)
#define mod 1000000007
int N, M;
int A[100100];
pii P[100100];
int ans;
signed main() {
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
P[i] = mk(b, a);
}
sort(A, A + N, greater<int>());
sort(P, P + M, greater<pii>());
int j = 0;
for (int i = 0; i < M; i++) {
while (A[j] > P[i].first && j < N) {
ans += A[j];
j++;
}
if (N - j >= P[i].second) {
ans += P[i].first * P[i].second;
N -= P[i].second;
} else {
ans += (N - j) * P[i].first;
N = j;
break;
}
}
if (N - j > 0) {
for (int i = j; i < N; i++) {
ans += A[i];
}
}
cout << ans << endl;
return 0;
}
/*
*/ | [
"assignment.add"
] | 853,998 | 853,999 | u384299515 | cpp |
p03038 | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
scanf("%d%d", &n, &m);
vector<pair<int, int>> z;
int i;
for (i = 0; i < n; i++) {
int a;
scanf("%d", &a);
z.push_back(make_pair(a, 1));
}
for (i = 0; i < m; i++) {
int b, c;
scanf("%d%d", &b, &c);
z.push_back(make_pair(c, b));
}
sort(z.rbegin(), z.rend());
ll sum = 0;
int cnt = 0;
for (i = 0; i < n; i++) {
int num = z[i].second;
if (cnt + num > n) {
sum += (z[i].first * (n - cnt));
break;
} else {
sum += ((ll)z[i].first * z[i].second);
cnt += z[i].second;
}
}
printf("%lld\n", sum);
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
scanf("%d%d", &n, &m);
vector<pair<int, int>> z;
int i;
for (i = 0; i < n; i++) {
int a;
scanf("%d", &a);
z.push_back(make_pair(a, 1));
}
for (i = 0; i < m; i++) {
int b, c;
scanf("%d%d", &b, &c);
z.push_back(make_pair(c, b));
}
sort(z.rbegin(), z.rend());
ll sum = 0;
int cnt = 0;
for (i = 0; i < n; i++) {
int num = z[i].second;
if (cnt + num > n) {
sum += ((ll)z[i].first * (n - cnt));
break;
} else {
sum += ((ll)z[i].first * z[i].second);
cnt += z[i].second;
}
}
printf("%lld\n", sum);
return 0;
}
| [
"type_conversion.add"
] | 854,012 | 854,013 | u209713918 | cpp |
p03038 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
sort(a.begin(), a.end());
vector<ii> b(m);
for (int i = 0; i < m; ++i) {
scanf("%d%d", &b[i].second, &b[i].first);
}
sort(b.begin(), b.end(), greater<ii>());
vector<int> c(n);
for (int i = 0, k = 0; i < m && k < n; ++i) {
int len = min(n - i, b[i].second);
while (len--)
c[k++] = b[i].first;
}
int64 ret = 0;
for (int i = 0; i < n; ++i) {
ret += max(a[i], c[i]);
}
printf("%lld\n", ret);
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<int> a(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
sort(a.begin(), a.end());
vector<ii> b(m);
for (int i = 0; i < m; ++i) {
scanf("%d%d", &b[i].second, &b[i].first);
}
sort(b.begin(), b.end(), greater<ii>());
vector<int> c(n);
for (int i = 0, k = 0; i < m && k < n; ++i) {
int len = min(n - k, b[i].second);
while (len--)
c[k++] = b[i].first;
}
int64 ret = 0;
for (int i = 0; i < n; ++i) {
ret += max(a[i], c[i]);
}
printf("%lld\n", ret);
return 0;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 854,022 | 854,023 | u112723190 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N, 0), B(M, 0), C(M, 0);
rep(i, N) cin >> A.at(i);
rep(i, M) cin >> B.at(i) >> C.at(i);
priority_queue<pair<int, int>> q;
rep(i, N) q.push(make_pair(A.at(i), 1));
rep(i, M) q.push(make_pair(C.at(i), B.at(i)));
int ans = 0;
rep(i, N) {
auto P = q.top();
q.pop();
ans += P.first;
if (P.second > 1) {
P.second--;
q.push(P);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N, 0), B(M, 0), C(M, 0);
rep(i, N) cin >> A.at(i);
rep(i, M) cin >> B.at(i) >> C.at(i);
priority_queue<pair<int, int>> q;
rep(i, N) q.push(make_pair(A.at(i), 1));
rep(i, M) q.push(make_pair(C.at(i), B.at(i)));
long long ans = 0;
rep(i, N) {
auto P = q.top();
q.pop();
ans += P.first;
if (P.second > 1) {
P.second--;
q.push(P);
}
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 854,072 | 854,073 | u768327203 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
// for(int i = 0; i < n; i++) cout << a[i] << " ";
// cout << endl;
vector<pair<int, int>> p(m);
for (int i = 0; i < m; i++) {
cin >> p[i].second >> p[i].first;
}
sort(p.rbegin(), p.rend());
// for(int i = 0; i < m; i++) cout << p[i].second << " " << p[i].first <<
// endl;
int j = 0, cnt = 1;
for (int i = 0; i < n; i++) {
if (cnt > p[j].second) {
cnt = 1;
j++;
}
if (a[i] >= p[j].first)
break;
else {
a[i] = p[j].first;
cnt++;
}
}
// for(int i = 0; i < n; i++) cout << a[i] << " ";
auto sum_ll = accumulate(a.begin(), a.end(), 0LL);
cout << sum_ll << endl;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
// for(int i = 0; i < n; i++) cout << a[i] << " ";
// cout << endl;
vector<pair<long int, int>> p(m);
for (int i = 0; i < m; i++) {
cin >> p[i].second >> p[i].first;
}
sort(p.rbegin(), p.rend());
// for(int i = 0; i < m; i++) cout << p[i].second << " " << p[i].first <<
// endl;
int j = 0, cnt = 1;
for (int i = 0; i < n; i++) {
if (cnt > p[j].second) {
cnt = 1;
j++;
}
if (a[i] >= p[j].first)
break;
else {
a[i] = p[j].first;
cnt++;
}
}
// for(int i = 0; i < n; i++) cout << a[i] << " ";
auto sum_ll = accumulate(a.begin(), a.end(), 0LL);
cout << sum_ll << endl;
}
| [
"variable_declaration.type.widen.change"
] | 854,078 | 854,079 | u927804708 | cpp |
p03038 | #include <algorithm>
#include <cstdio>
#include <vector>
int main() {
std::vector<std::pair<int, int>> vec;
int N, M, A, B, C;
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++) {
scanf("%d", &A);
vec.push_back(std::make_pair(A, 1));
}
for (int i = 0; i < M; i++) {
scanf("%d %d", &B, &C);
vec.push_back(std::make_pair(C, B));
}
std::sort(vec.begin(), vec.end());
long long t = 0;
for (auto it = vec.rbegin(); N != 0; it++) {
int n = std::min(N, it->second);
t += it->first * n;
N -= n;
}
printf("%lld\n", t);
}
| #include <algorithm>
#include <cstdio>
#include <vector>
int main() {
std::vector<std::pair<int, int>> vec;
int N, M, A, B, C;
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++) {
scanf("%d", &A);
vec.push_back(std::make_pair(A, 1));
}
for (int i = 0; i < M; i++) {
scanf("%d %d", &B, &C);
vec.push_back(std::make_pair(C, B));
}
std::sort(vec.begin(), vec.end());
long long t = 0;
for (auto it = vec.rbegin(); N != 0; it++) {
int n = std::min(N, it->second);
t += it->first * (long long)n;
N -= n;
}
printf("%lld\n", t);
}
| [
"type_conversion.add"
] | 854,104 | 854,105 | u023077142 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> all;
REP(i, n) {
int a;
cin >> a;
all.push_back(make_pair(a, 1));
}
REP(i, m) {
int b, c;
cin >> b >> c;
all.push_back(make_pair(c, b));
}
sort(all.begin(), all.end(), greater<pair<int, int>>());
int64_t ans = 0;
int i = 0;
while (n) {
int k = min(n, all.at(i).second);
ans += k * all.at(i).first;
n -= k;
i++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> all;
REP(i, n) {
int a;
cin >> a;
all.push_back(make_pair(a, 1));
}
REP(i, m) {
int b, c;
cin >> b >> c;
all.push_back(make_pair(c, b));
}
sort(all.begin(), all.end(), greater<pair<int, int>>());
int64_t ans = 0;
int i = 0;
while (n) {
int64_t k = min(n, all.at(i).second);
ans += k * all.at(i).first;
n -= k;
i++;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 854,106 | 854,107 | u973991908 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) rep(i, 0, n)
#define RREP(i, n) rrep(i, n, 0)
int main() {
int n, m;
cin >> n >> m;
// cout<<endl;
vector<pair<int, int>> all;
REP(i, n) {
int a;
cin >> a;
all.push_back(make_pair(a, 1));
}
REP(i, m) {
int b, c;
cin >> b >> c;
all.push_back(make_pair(c, b));
}
sort(all.begin(), all.end(), greater<pair<int, int>>());
// cout<<endl;
// REP(i,n+m)
// {
// cout<<all.at(i).first<<" "<<all.at(i).second<<endl;
// }
// cout<<endl;
int ans = 0, j = 0;
REP(i, n) {
if (all.at(j).second <= 0) {
j++;
i--;
} else {
ans += all.at(j).first;
all.at(j).second--;
}
// cout<<"j="<<j<<"i="<<i<<endl;
// cout<<ans<<endl;
// cout<<endl;
}
cout << ans << endl;
} | /*
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) rep(i, 0, n)
#define RREP(i, n) rrep(i, n, 0)
int main() {
int n, m;
cin >> n >> m;
// cout<<endl;
vector<pair<int, int>> all;
REP(i, n) {
int a;
cin >> a;
all.push_back(make_pair(a, 1));
}
REP(i, m) {
int b, c;
cin >> b >> c;
all.push_back(make_pair(c, b));
}
sort(all.begin(), all.end(), greater<pair<int, int>>());
// cout<<endl;
// REP(i,n+m)
// {
// cout<<all.at(i).first<<" "<<all.at(i).second<<endl;
// }
// cout<<endl;
int64_t ans = 0;
int j = 0;
REP(i, n) {
if (all.at(j).second <= 0) {
j++;
i--;
} else {
ans += all.at(j).first;
all.at(j).second--;
}
// cout<<"j="<<j<<"i="<<i<<endl;
// cout<<ans<<endl;
// cout<<endl;
}
cout << ans << endl;
} | [
"variable_declaration.type.primitive.change"
] | 854,108 | 854,109 | u973991908 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int n, m;
ll a[100001], b[100001], c[100001];
l_l cb[100001];
ll ans;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i] >> c[i];
cb[i] = make_pair(c[i], b[i]);
}
sort(a, a + n);
sort(cb, cb + m, greater<l_l>());
ll it = -1;
for (int i = 0; i < m; i++) {
ll B = cb[i].second;
ll C = cb[i].first;
it += B;
if (it > n) {
it -= B;
for (int j = it + 1; j < n; j++) {
ans += max(C, a[j]);
}
it = n - 1;
break;
}
if (a[it] > C) {
ll mem = it - B + 1;
for (int j = mem; j < mem + B; j++) {
ans += max(C, a[j]);
}
break;
}
ans += C * B;
}
for (int i = it + 1; i < n; i++) {
ans += a[i];
// cout << ans << endl;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int n, m;
ll a[100001], b[100001], c[100001];
l_l cb[100001];
ll ans;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i] >> c[i];
cb[i] = make_pair(c[i], b[i]);
}
sort(a, a + n);
sort(cb, cb + m, greater<l_l>());
ll it = -1;
for (int i = 0; i < m; i++) {
ll B = cb[i].second;
ll C = cb[i].first;
it += B;
if (it >= n) {
it -= B;
for (int j = it + 1; j < n; j++) {
ans += max(C, a[j]);
}
it = n - 1;
break;
}
if (a[it] > C) {
ll mem = it - B + 1;
for (int j = mem; j < mem + B; j++) {
ans += max(C, a[j]);
}
break;
}
ans += C * B;
}
for (int i = it + 1; i < n; i++) {
ans += a[i];
// cout << ans << endl;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 854,110 | 854,111 | u263858205 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int n, m;
ll a[100001], b[100001], c[100001];
l_l cb[100001];
ll ans;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i] >> c[i];
cb[i] = make_pair(c[i], b[i]);
}
sort(a, a + n);
sort(cb, cb + m, greater<l_l>());
ll it = -1;
for (int i = 0; i < m; i++) {
ll B = cb[i].second;
ll C = cb[i].first;
it += B;
if (it > n) {
it -= B;
for (int j = it + 1; j < n; j++) {
ans += max(C, a[j]);
}
it = n - 1;
break;
}
if (a[it] > C) {
ll mem = it - B + 1;
for (int j = mem; j < mem + B; j++) {
ans += max(C, a[j]);
// cout << C << " " << ans << endl;
}
break;
}
ans += C * B;
// cout << C << " " << ans << endl;
}
for (int i = it + 1; i < n; i++) {
ans += a[i];
// cout << ans << endl;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int n, m;
ll a[100001], b[100001], c[100001];
l_l cb[100001];
ll ans;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i] >> c[i];
cb[i] = make_pair(c[i], b[i]);
}
sort(a, a + n);
sort(cb, cb + m, greater<l_l>());
ll it = -1;
for (int i = 0; i < m; i++) {
ll B = cb[i].second;
ll C = cb[i].first;
it += B;
if (it >= n) {
it -= B;
for (int j = it + 1; j < n; j++) {
ans += max(C, a[j]);
}
it = n - 1;
break;
}
if (a[it] > C) {
ll mem = it - B + 1;
for (int j = mem; j < mem + B; j++) {
ans += max(C, a[j]);
}
break;
}
ans += C * B;
}
for (int i = it + 1; i < n; i++) {
ans += a[i];
// cout << ans << endl;
}
cout << ans << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 854,112 | 854,111 | u263858205 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.