problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03038 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
template <typename F, typename S>
std::ostream &operator<<(ostream &os, const pair<F, S> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (const T &a : v) {
os << a << ", ";
}
os << "]";
return os;
}
template <typename K, typename V>
ostream &operator<<(ostream &os, const map<K, V> &m) {
os << "{";
for (const auto &p : m) {
os << p.first << ":" << p.second << ", ";
}
os << "]";
return os;
}
int main() {
LL n, m;
cin >> n >> m;
vector<LL> a(n);
for (LL i = 0; i < n; ++i) {
cin >> a[i];
}
vector<pair<LL, LL>> cmd(m);
for (LL i = 0; i < m; ++i) {
cin >> cmd[i].second >> cmd[i].first;
}
sort(cmd.begin(), cmd.end(), greater<pair<LL, LL>>());
vector<LL> b;
for (auto p : cmd) {
for (LL i = 0; i < p.second; ++i) {
if (b.size() >= n)
break;
b.push_back(p.first);
}
}
sort(a.begin(), a.end());
LL ans = 0;
for (LL i = 0; i < n; ++i) {
ans += max<LL>(a[i], b[i]);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
template <typename F, typename S>
std::ostream &operator<<(ostream &os, const pair<F, S> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (const T &a : v) {
os << a << ", ";
}
os << "]";
return os;
}
template <typename K, typename V>
ostream &operator<<(ostream &os, const map<K, V> &m) {
os << "{";
for (const auto &p : m) {
os << p.first << ":" << p.second << ", ";
}
os << "]";
return os;
}
int main() {
LL n, m;
cin >> n >> m;
vector<LL> a(n);
for (LL i = 0; i < n; ++i) {
cin >> a[i];
}
vector<pair<LL, LL>> cmd(m);
for (LL i = 0; i < m; ++i) {
cin >> cmd[i].second >> cmd[i].first;
}
sort(cmd.begin(), cmd.end(), greater<pair<LL, LL>>());
vector<LL> b;
for (auto p : cmd) {
for (LL i = 0; i < p.second; ++i) {
if (b.size() >= n)
break;
b.push_back(p.first);
}
}
sort(a.begin(), a.end());
LL ans = 0;
for (LL i = 0; i < n; ++i) {
if (i < b.size()) {
ans += max<LL>(a[i], b[i]);
} else {
ans += a[i];
}
}
cout << ans << endl;
return 0;
}
| replace | 61 | 62 | 61 | 66 | 0 | |
p03038 | Python | Time Limit Exceeded | import sys
from collections import defaultdict
from collections import deque
input = sys.stdin.readline
new_cards = defaultdict(int)
n, m = map(int, input().split())
A = deque(sorted(list(map(int, input().split()))))
for i in range(m):
b, c = map(int, input().split())
new_cards[c] += b
for card, count in sorted(new_cards.items(), reverse=True):
for i in range(count):
if A[0] < card:
A.append(card)
A.popleft()
print(sum(A))
| import sys
from collections import defaultdict
from collections import deque
input = sys.stdin.readline
new_cards = defaultdict(int)
n, m = map(int, input().split())
A = deque(sorted(list(map(int, input().split()))))
for i in range(m):
b, c = map(int, input().split())
new_cards[c] += b
for card, count in sorted(new_cards.items(), reverse=True):
for i in range(count):
if A[0] < card:
A.append(card)
A.popleft()
else:
print(sum(A))
exit()
print(sum(A))
| insert | 19 | 19 | 19 | 22 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> w(m + 100100);
for (ll i = m; i < m + 100100; i++) {
w[i].second = 0;
}
for (ll i = 0; i < n; i++) {
ll a;
cin >> a;
w[m + a].first = a;
w[m + a].second++;
}
for (ll i = 0; i < m; i++) {
cin >> w[i].second >> w[i].first;
}
sort(w.begin(), w.end());
ll i = w.size() - 1;
ll cnt = 0;
ll sum = 0;
bool f = false;
while (true) {
while (w[i].second > 0) {
sum += w[i].first;
cnt++;
if (cnt == n) {
f = true;
break;
}
w[i].second--;
}
if (f) {
break;
}
i--;
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
vector<pair<ll, ll>> w(m + 100100);
for (ll i = m; i < m + 100100; i++) {
w[i].second = 0;
}
for (ll i = 0; i < n; i++) {
ll a;
cin >> a;
w[m + i].first = a;
w[m + i].second++;
}
for (ll i = 0; i < m; i++) {
cin >> w[i].second >> w[i].first;
}
sort(w.begin(), w.end());
ll i = w.size() - 1;
ll cnt = 0;
ll sum = 0;
bool f = false;
while (true) {
while (w[i].second > 0) {
sum += w[i].first;
cnt++;
if (cnt == n) {
f = true;
break;
}
w[i].second--;
}
if (f) {
break;
}
i--;
}
cout << sum << endl;
} | replace | 17 | 19 | 17 | 19 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
using namespace std;
ll t, n, a[MAXX], b[MAXX], c[MAXX];
vector<ll> adj[MAXX];
vector<pair<int, int>> v;
bool used[MAXX];
multiset<int> ms;
signed main() {
FAST;
ll r;
ll m;
cin >> n >> m;
for (ll i = 0; i < n; i++) {
cin >> a[i];
ms.insert(a[i]);
}
for (ll i = 0; i < m; i++) {
cin >> b[i] >> c[i];
sort(a, a + n);
v.push_back({c[i], b[i]});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
ll ans = 0;
for (ll i = 0; i < v.size(); i++) {
ll x = v[i].first, y = v[i].second;
while (*(ms.begin()) < x && y) {
ms.erase(ms.begin());
ms.insert(x);
y--;
}
}
while (n) {
ans += *(ms.begin());
ms.erase(ms.begin());
n--;
}
cout << ans;
} | #include <bits/stdc++.h>
#define FAST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MAXX 100005
#define PI 3.14159265358979323846264338327950
#define ll signed long long int
using namespace std;
ll t, n, a[MAXX], b[MAXX], c[MAXX];
vector<ll> adj[MAXX];
vector<pair<int, int>> v;
bool used[MAXX];
multiset<int> ms;
signed main() {
FAST;
ll r;
ll m;
cin >> n >> m;
for (ll i = 0; i < n; i++) {
cin >> a[i];
ms.insert(a[i]);
}
for (ll i = 0; i < m; i++) {
cin >> b[i] >> c[i];
v.push_back({c[i], b[i]});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
ll ans = 0;
for (ll i = 0; i < v.size(); i++) {
ll x = v[i].first, y = v[i].second;
while (*(ms.begin()) < x && y) {
ms.erase(ms.begin());
ms.insert(x);
y--;
}
}
while (n) {
ans += *(ms.begin());
ms.erase(ms.begin());
n--;
}
cout << ans;
} | delete | 26 | 27 | 26 | 26 | TLE | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
using namespace std;
typedef long long ll;
// 定義場所//
ll i, j, k, l, m, n;
ll N, M, K;
ll MOD = 1000000007;
ll ans = 0;
////////////
bool pairCompare(const pair<ll, ll> firstElof, pair<ll, ll> secondElof) {
return firstElof.second > secondElof.second;
}
int main() {
cin >> N >> M;
vector<ll> A;
vector<pair<ll, ll>> BC(N);
ll ans = 0;
for (i = 0; i < N; i++) {
ll a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
for (i = 0; i < M; i++) {
int b, c;
cin >> b >> c;
BC[i] = make_pair(b, c);
}
sort(BC.begin(), BC.end(), pairCompare);
// reverse(BC.begin(), BC.end());
int depth = 0;
int count = 0;
for (i = 0; i < N; i++) {
if (A[i] < BC[depth].second) {
A[i] = BC[depth].second;
count++;
} else {
break;
}
if (count >= BC[depth].first) {
depth++;
count = 0;
if (depth > M - 1) {
break;
}
}
}
for (i = 0; i < N; i++) {
ans += A[i];
}
cout << ans;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
using namespace std;
typedef long long ll;
// 定義場所//
ll i, j, k, l, m, n;
ll N, M, K;
ll MOD = 1000000007;
ll ans = 0;
////////////
bool pairCompare(const pair<ll, ll> firstElof, pair<ll, ll> secondElof) {
return firstElof.second > secondElof.second;
}
int main() {
cin >> N >> M;
vector<ll> A;
vector<pair<ll, ll>> BC(100000);
ll ans = 0;
for (i = 0; i < N; i++) {
ll a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
for (i = 0; i < M; i++) {
int b, c;
cin >> b >> c;
BC[i] = make_pair(b, c);
}
sort(BC.begin(), BC.end(), pairCompare);
// reverse(BC.begin(), BC.end());
int depth = 0;
int count = 0;
for (i = 0; i < N; i++) {
if (A[i] < BC[depth].second) {
A[i] = BC[depth].second;
count++;
} else {
break;
}
if (count >= BC[depth].first) {
depth++;
count = 0;
if (depth > M - 1) {
break;
}
}
}
for (i = 0; i < N; i++) {
ans += A[i];
}
cout << ans;
} | replace | 48 | 49 | 48 | 49 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, m, n) for (int i = int(m); i < int(n); i++)
#define all(c) begin(c), end(c)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// 改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 // デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
// ここから編集する
class Solve {
public:
void input() {}
void solve() {
input();
int N, M;
cin >> N >> M;
vector<ll> A(N);
rep(i, 0, N) cin >> A[i];
vector<pair<ll, ll>> cb(M);
rep(i, 0, M) { cin >> cb[i].second >> cb[i].first; }
sort(all(cb));
reverse(all(cb));
vector<ll> D;
int idx = 0;
while (D.size() < A.size() && idx < cb.size()) {
ll val = cb[idx].first;
ll cnt = cb[idx].second;
for (ll i = 0; i < cnt && D.size() < A.size(); ++i) {
D.push_back(val);
}
idx++;
}
sort(all(A));
ll ans = 0ll;
for (int i = 0; i < N; ++i) {
ans += max(A[i], D[i]);
}
cout << ans << endl;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solve().solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, m, n) for (int i = int(m); i < int(n); i++)
#define all(c) begin(c), end(c)
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// 改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 // デバッグする時1にしてね
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
// ここから編集する
class Solve {
public:
void input() {}
void solve() {
input();
int N, M;
cin >> N >> M;
vector<ll> A(N);
rep(i, 0, N) cin >> A[i];
vector<pair<ll, ll>> cb(M);
rep(i, 0, M) { cin >> cb[i].second >> cb[i].first; }
sort(all(cb));
reverse(all(cb));
vector<ll> D;
int idx = 0;
while (D.size() < A.size() && idx < cb.size()) {
ll val = cb[idx].first;
ll cnt = cb[idx].second;
for (ll i = 0; i < cnt && D.size() < A.size(); ++i) {
D.push_back(val);
}
idx++;
}
while (D.size() < A.size()) {
D.push_back(0);
}
sort(all(A));
ll ans = 0ll;
for (int i = 0; i < N; ++i) {
ans += max(A[i], D[i]);
}
cout << ans << endl;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Solve().solve();
return 0;
}
| insert | 86 | 86 | 86 | 90 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define pp pop_back
#define mp make_pair
#define ff first
#define ss second
#define maxn 1000000007
#define PI 3.14159265358979323846
#define MAX 1000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// cout<<fixed<<setprecision(20);
ll n, m;
cin >> n >> m;
std::vector<ll> a;
vector<ll>::iterator it;
multiset<ll> s;
multiset<ll>::iterator it1, it2;
ll sum = 0;
for (int i = 0; i < n; ++i) {
ll x;
cin >> x;
a.pb(x);
s.insert(x);
sum += x;
}
// cout<<sum<<endl;
pair<ll, ll> b[m];
for (int i = 0; i < m; ++i) {
cin >> b[i].ss >> b[i].ff;
}
sort(b, b + m);
for (int i = 0; i < m; ++i) {
ll x = 0;
while (*s.begin() < b[i].ff) {
s.erase(s.begin());
s.insert(b[i].ff);
x++;
if (x == b[i].ss) {
break;
}
}
}
sum = 0;
for (it1 = s.begin(); it1 != s.end(); it1++) {
sum += *it1;
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define pp pop_back
#define mp make_pair
#define ff first
#define ss second
#define maxn 1000000007
#define PI 3.14159265358979323846
#define MAX 1000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// cout<<fixed<<setprecision(20);
ll n, m;
cin >> n >> m;
std::vector<ll> a;
vector<ll>::iterator it;
multiset<ll> s;
multiset<ll>::iterator it1, it2;
ll sum = 0;
for (int i = 0; i < n; ++i) {
ll x;
cin >> x;
a.pb(x);
s.insert(x);
sum += x;
}
// cout<<sum<<endl;
pair<ll, ll> b[m];
for (int i = 0; i < m; ++i) {
cin >> b[i].ss >> b[i].ff;
}
sort(b, b + m);
for (int i = m - 1; i >= 0; i--) {
ll x = 0;
while (*s.begin() < b[i].ff) {
s.erase(s.begin());
s.insert(b[i].ff);
x++;
if (x == b[i].ss) {
break;
}
}
}
sum = 0;
for (it1 = s.begin(); it1 != s.end(); it1++) {
sum += *it1;
}
cout << sum << endl;
return 0;
} | replace | 37 | 38 | 37 | 38 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define INF 1000000000000000
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define pb push_back
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
struct edge {
int to, cost;
};
typedef pair<int, int> P;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool prime(int a) {
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
bool kosa(double ax, double ay, double bx, double by, double cx, double cy,
double dx, double dy) { // 線分の交差判定
double ta = (cx - dx) * (ay - cy) + (cy - dy) * (cx - ax);
double tb = (cx - dx) * (by - cy) + (cy - dy) * (cx - bx);
double tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx);
double td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx);
return tc * td < 0 && ta * tb < 0;
}
int kaijo(int n) {
int ans = 1;
for (int i = 2; i <= n; i++) {
ans *= i;
ans %= MOD;
}
return ans;
}
int modpow(int a, int b) {
if (b == 0)
return 1;
if (b % 2)
return modpow(a, b - 1) * a % MOD;
return modpow(a, b / 2) * modpow(a, b / 2) % MOD;
}
int comb(int a, int b) {
return kaijo(a) * modpow(kaijo(a - b), MOD - 2) % MOD *
modpow(kaijo(b), MOD - 2) % MOD;
}
int n, m, a[114514], memo[114514], cnt[114514], sum;
P p[114514];
signed main() {
cin >> n >> m;
rep(i, n) cin >> a[i];
sort(a, a + n);
rep(i, m) cin >> p[i].second >> p[i].first;
sort(p, p + m, greater<P>());
int now = 0;
rep(i, m) {
rep(j, p[i].second) {
if (a[now] < p[i].first) {
a[now] = p[i].first;
now++;
} else
goto no;
}
}
no:;
rep(i, n) { sum += a[i]; }
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define INF 1000000000000000
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define pb push_back
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
struct edge {
int to, cost;
};
typedef pair<int, int> P;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
bool prime(int a) {
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0)
return false;
}
return true;
}
bool kosa(double ax, double ay, double bx, double by, double cx, double cy,
double dx, double dy) { // 線分の交差判定
double ta = (cx - dx) * (ay - cy) + (cy - dy) * (cx - ax);
double tb = (cx - dx) * (by - cy) + (cy - dy) * (cx - bx);
double tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx);
double td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx);
return tc * td < 0 && ta * tb < 0;
}
int kaijo(int n) {
int ans = 1;
for (int i = 2; i <= n; i++) {
ans *= i;
ans %= MOD;
}
return ans;
}
int modpow(int a, int b) {
if (b == 0)
return 1;
if (b % 2)
return modpow(a, b - 1) * a % MOD;
return modpow(a, b / 2) * modpow(a, b / 2) % MOD;
}
int comb(int a, int b) {
return kaijo(a) * modpow(kaijo(a - b), MOD - 2) % MOD *
modpow(kaijo(b), MOD - 2) % MOD;
}
int n, m, a[114514], memo[114514], cnt[114514], sum;
P p[114514];
signed main() {
cin >> n >> m;
rep(i, n) cin >> a[i];
sort(a, a + n);
rep(i, m) cin >> p[i].second >> p[i].first;
sort(p, p + m, greater<P>());
int now = 0;
rep(i, m) {
rep(j, p[i].second) {
if (now >= n)
goto no;
if (a[now] < p[i].first) {
a[now] = p[i].first;
now++;
} else
goto no;
}
}
no:;
rep(i, n) { sum += a[i]; }
cout << sum << endl;
return 0;
}
| insert | 68 | 68 | 68 | 70 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<P> cb(m);
rep(i, m) {
int b, c;
cin >> b >> c;
cb.at(i) = make_pair(c, b);
}
// ソート
sort(a.begin(), a.end());
sort(cb.rbegin(), cb.rend());
int ai = 0;
for (auto ccbb : cb) {
rep(i, ccbb.second) {
if (a.at(ai) < ccbb.first) {
a.at(ai) = ccbb.first;
ai++;
}
if (ai >= n) {
break;
}
}
if (ai >= n) {
break;
}
}
ll res = 0;
rep(i, n) { res += a.at(i); }
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<P> cb(m);
rep(i, m) {
int b, c;
cin >> b >> c;
cb.at(i) = make_pair(c, b);
}
// ソート
sort(a.begin(), a.end());
sort(cb.rbegin(), cb.rend());
int ai = 0;
for (auto ccbb : cb) {
rep(i, ccbb.second) {
if (a.at(ai) < ccbb.first) {
a.at(ai) = ccbb.first;
ai++;
} else {
break;
}
if (ai >= n) {
break;
}
}
if (ai >= n) {
break;
}
}
ll res = 0;
rep(i, n) { res += a.at(i); }
cout << res << endl;
return 0;
}
| insert | 29 | 29 | 29 | 31 | TLE | |
p03038 | C++ | Runtime Error | /**
* 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;
}
| replace | 40 | 41 | 40 | 41 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define fi first
#define se second
typedef long long ll;
int N, M, H, W, K, A, B;
string S;
string alpha = "abcdefghijklmnopqrstuvwxyz";
string ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
cin >> N >> M;
vector<ll> a(N, 0);
vector<pair<ll, ll>> cb(M, pair<ll, ll>(0, 0));
rep(i, N) cin >> a.at(i);
rep(i, M) cin >> cb.at(i).se >> cb.at(i).fi;
sort(a.begin(), a.end());
sort(cb.begin(), cb.end());
reverse(cb.begin(), cb.end());
int card = 0;
bool fin = false;
rep(i, M) {
rep(j, cb.at(i).se) {
if (a.at(card) > cb.at(i).fi || card == N) {
fin = true;
break;
}
a.at(card) = cb.at(i).fi;
card++;
}
if (fin)
break;
}
ll ans = 0;
rep(i, N) ans += a.at(i);
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define fi first
#define se second
typedef long long ll;
int N, M, H, W, K, A, B;
string S;
string alpha = "abcdefghijklmnopqrstuvwxyz";
string ALPHA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main() {
cin >> N >> M;
vector<ll> a(N, 0);
vector<pair<ll, ll>> cb(M, pair<ll, ll>(0, 0));
rep(i, N) cin >> a.at(i);
rep(i, M) cin >> cb.at(i).se >> cb.at(i).fi;
sort(a.begin(), a.end());
sort(cb.begin(), cb.end());
reverse(cb.begin(), cb.end());
int card = 0;
bool fin = false;
rep(i, M) {
rep(j, cb.at(i).se) {
if (card == N) {
fin = true;
break;
}
if (a.at(card) > cb.at(i).fi) {
fin = true;
break;
}
a.at(card) = cb.at(i).fi;
card++;
}
if (fin)
break;
}
ll ans = 0;
rep(i, N) ans += a.at(i);
cout << ans << endl;
} | replace | 35 | 36 | 35 | 40 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct c {
int a;
int b;
bool operator<(const c &right) const { return b > right.b; }
};
int main() {
long long int n, m, i, j, ima = 0, wa = 0;
cin >> n >> m;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
vector<c> d(m);
for (i = 0; i < m; i++) {
cin >> d[i].a >> d[i].b;
}
sort(d.begin(), d.end());
for (i = 0; i < m; i++) {
for (;;) {
if (a[ima] < d[i].b) {
a[ima] = d[i].b;
}
d[i].a--;
ima++;
if (d[i].a == 0 || ima == n) {
break;
}
if (ima == n) {
break;
}
}
}
for (i = 0; i < n; i++) {
wa += a[i];
}
cout << wa;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct c {
int a;
int b;
bool operator<(const c &right) const { return b > right.b; }
};
int main() {
long long int n, m, i, j, ima = 0, wa = 0;
cin >> n >> m;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
vector<c> d(m);
for (i = 0; i < m; i++) {
cin >> d[i].a >> d[i].b;
}
sort(d.begin(), d.end());
for (i = 0; i < m; i++) {
for (;;) {
if (a[ima] < d[i].b) {
a[ima] = d[i].b;
}
d[i].a--;
ima++;
if (d[i].a == 0 || ima == n) {
break;
}
}
if (ima == n) {
break;
}
}
for (i = 0; i < n; i++) {
wa += a[i];
}
cout << wa;
} | replace | 37 | 40 | 37 | 40 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<ll> A(N);
vector<pair<ll, ll>> B(M);
REP(i, N) cin >> A.at(i);
REP(i, M) {
int x, y;
cin >> x;
cin >> y;
B.at(i) = make_pair(y, x);
}
sort(B.rbegin(), B.rend());
sort(A.begin(), A.end());
int x = 0;
bool ok = 0;
REP(i, M) {
REP(l, B.at(i).second) {
if (A.at(x) < B.at(i).first) {
A.at(x) = B.at(i).first;
x++;
if (x >= N)
ok = 1;
}
if (ok == 1)
break;
}
if (ok == 1)
break;
}
ll answer = 0;
REP(i, N) answer += A.at(i);
cout << answer << "\n";
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<ll> A(N);
vector<pair<ll, ll>> B(M);
REP(i, N) cin >> A.at(i);
REP(i, M) {
int x, y;
cin >> x;
cin >> y;
B.at(i) = make_pair(y, x);
}
sort(B.rbegin(), B.rend());
sort(A.begin(), A.end());
int x = 0;
bool ok = 0;
REP(i, M) {
REP(l, B.at(i).second) {
if (A.at(x) < B.at(i).first) {
A.at(x) = B.at(i).first;
x++;
if (x >= N)
ok = 1;
} else {
ok = 1;
}
if (ok == 1)
break;
}
if (ok == 1)
break;
}
ll answer = 0;
REP(i, N) answer += A.at(i);
cout << answer << "\n";
}
| insert | 30 | 30 | 30 | 32 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
long b, c, temp = 9999999999, ans = 0;
vector<pair<long, long>> p;
cin >> n >> m;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
temp = min(temp, a[i]);
}
for (int i = 0; i < m; i++) {
cin >> b >> c;
p.push_back(make_pair(c, b));
}
sort(p.begin(), p.end());
sort(a.begin(), a.end());
long soe = 0;
m--;
while (p[m].first >= a[soe] && n >= 0) {
while (p[m].first > a[soe] && p[m].second > 0) {
a[soe] = p[m].first;
p[m].second--;
soe++;
}
m--;
}
for (int i = 0; i < a.size(); i++) {
ans += a[i];
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
long b, c, temp = 9999999999, ans = 0;
vector<pair<long, long>> p;
cin >> n >> m;
vector<long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
temp = min(temp, a[i]);
}
for (int i = 0; i < m; i++) {
cin >> b >> c;
p.push_back(make_pair(c, b));
}
sort(p.begin(), p.end());
sort(a.begin(), a.end());
long soe = 0;
m--;
while (p[m].first >= a[soe] && m >= 0) {
while (p[m].first > a[soe] && p[m].second > 0) {
a[soe] = p[m].first;
p[m].second--;
soe++;
}
m--;
}
for (int i = 0; i < a.size(); i++) {
ans += a[i];
}
cout << ans;
return 0;
} | replace | 28 | 29 | 28 | 29 | 0 | |
p03038 | C++ | Runtime Error | #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;
}
| replace | 39 | 40 | 39 | 40 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int n, m;
vector<Int> a;
multimap<Int, Int, greater<Int>> bc;
cin >> n >> m;
for (Int i = 0; i < n; i++) {
cin >> tmpi;
a.push_back(tmpi);
}
Int tmpi2;
for (Int i = 0; i < m; i++) {
cin >> tmpi >> tmpi2;
bc.insert(make_pair(tmpi2, tmpi));
}
sort(a.begin(), a.end());
Int it = 0;
Int sum = 0;
Int cnt = 0;
for (const auto &u : bc) {
Int num = u.first;
Int len = u.second;
bool flg = false;
Int maxlen = it + len - 1 < n ? it + len - 1 : n;
for (Int i = it + len - 1; i >= it; i--) {
cnt++;
if (a[i] < num) {
sum += num * (i - it + 1);
it = i + 1;
if (cnt != bc.size()) {
flg = true;
}
break;
}
}
if (!flg) {
for (Int i = it; i < n; i++) {
sum += a[i];
}
break;
}
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using Int = long long int;
template <typename T> void swap(T *t1, T *t2) {
T *tmp = t1;
t1 = t2;
t2 = tmp;
}
Int tmpi = 0;
double tmpd = 0.0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Int n, m;
vector<Int> a;
multimap<Int, Int, greater<Int>> bc;
cin >> n >> m;
for (Int i = 0; i < n; i++) {
cin >> tmpi;
a.push_back(tmpi);
}
Int tmpi2;
for (Int i = 0; i < m; i++) {
cin >> tmpi >> tmpi2;
bc.insert(make_pair(tmpi2, tmpi));
}
sort(a.begin(), a.end());
Int it = 0;
Int sum = 0;
Int cnt = 0;
for (const auto &u : bc) {
Int num = u.first;
Int len = u.second;
bool flg = false;
Int maxlen = it + len < n ? it + len : n;
for (Int i = maxlen - 1; i >= it; i--) {
cnt++;
if (a[i] < num) {
sum += num * (i - it + 1);
it = i + 1;
if (cnt != bc.size()) {
flg = true;
}
break;
}
}
if (!flg) {
for (Int i = it; i < n; i++) {
sum += a[i];
}
break;
}
}
cout << sum << endl;
return 0;
} | replace | 37 | 39 | 37 | 39 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> v(n);
vector<pair<ll, ll>> nikola;
for (ll i = 0; i < n; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
for (ll i = 0; i < m; ++i) {
ll b, c;
cin >> b >> c;
nikola.push_back(make_pair(c, b));
}
sort(nikola.begin(), nikola.end());
reverse(nikola.begin(), nikola.end());
ll ans = 0, cur = 0;
for (ll i = 0; i < n; ++i) {
if (nikola[cur].first > v[i] && nikola[cur].second > 0) {
ans += nikola[cur].first;
nikola[cur].second--;
} else if (nikola[cur].second == 0) {
cur++;
if (i == n - 1) {
ans += v[i];
break;
}
i--;
} else {
ans += v[i];
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> v(n);
vector<pair<ll, ll>> nikola;
for (ll i = 0; i < n; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
for (ll i = 0; i < m; ++i) {
ll b, c;
cin >> b >> c;
nikola.push_back(make_pair(c, b));
}
sort(nikola.begin(), nikola.end());
reverse(nikola.begin(), nikola.end());
ll ans = 0, cur = 0;
for (ll i = 0; i < n; ++i) {
if (nikola[cur].first > v[i] && nikola[cur].second > 0) {
ans += nikola[cur].first;
nikola[cur].second--;
} else if (nikola[cur].second == 0 && cur < m) {
cur++;
if (i == n - 1) {
ans += v[i];
break;
}
i--;
} else {
ans += v[i];
}
}
cout << ans;
}
| replace | 27 | 28 | 27 | 28 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
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());
vector<pair<int, int>> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i].first >> x[i].second;
}
sort(x.begin(), x.end(),
[](const pair<int, int> &p, const pair<int, int> &q) {
return p.second > q.second;
});
vector<int> d;
bool fill = false;
for (int i = 0; i < m; i++) {
for (int j = 0; j < x[i].first; j++) {
d.push_back(x[i].second);
if (d.size() == n) {
fill = true;
break;
}
}
if (fill) {
break;
}
}
for (int i = 0; i < n; i++) {
if (d[i] >= a[i]) {
a[i] = d[i];
}
}
ll sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
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());
vector<pair<int, int>> x(m);
for (int i = 0; i < m; i++) {
cin >> x[i].first >> x[i].second;
}
sort(x.begin(), x.end(),
[](const pair<int, int> &p, const pair<int, int> &q) {
return p.second > q.second;
});
vector<int> d;
bool fill = false;
for (int i = 0; i < m; i++) {
for (int j = 0; j < x[i].first; j++) {
d.push_back(x[i].second);
if (d.size() == n) {
fill = true;
break;
}
}
if (fill) {
break;
}
}
for (int i = 0; i < n; i++) {
if (d.size() > i && d[i] >= a[i]) {
a[i] = d[i];
}
}
ll sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
cout << sum << endl;
return 0;
} | replace | 34 | 35 | 34 | 35 | 0 | |
p03038 | C++ | Runtime Error | #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;
}
| replace | 62 | 63 | 62 | 63 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int, int> pii;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define S second
const int INF = 987654321;
const ll MOD = 1000000007LL;
ll ipow(ll base, ll exp) {
ll result = 1LL;
for (;;) {
if (exp & 1)
result *= base;
exp >>= 1;
if (!exp)
break;
base *= base;
}
return result;
}
// const long double PI = (acos(-1));
// const long double EPS = 0.0000000001;
int n, m;
vi a;
map<ll, ll> record;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("in.txt", "r", stdin);
cin >> n >> m;
a.resize(n);
rep(i, 0, n) { cin >> a[i]; }
rep(i, 0, m) {
ll b, c;
cin >> b >> c;
if (record.find(c) != record.end()) {
record[c] += b;
record[c] = max(record[c], (ll)n);
} else {
record[c] = b;
}
}
ll cnt = n;
auto it = record.rbegin();
while (cnt > 0 && it != record.rend()) {
ll b = it->S;
ll c = it->F;
// cout << b << " : " << c << endl;
for (int i = 0; i < b; ++i) {
a.pb(c);
}
cnt -= b;
it++;
}
sort(all(a));
ll total = 0;
per(i, sz(a) - n, sz(a)) { total += (ll)a[i]; }
cout << total << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int, int> pii;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define S second
const int INF = 987654321;
const ll MOD = 1000000007LL;
ll ipow(ll base, ll exp) {
ll result = 1LL;
for (;;) {
if (exp & 1)
result *= base;
exp >>= 1;
if (!exp)
break;
base *= base;
}
return result;
}
// const long double PI = (acos(-1));
// const long double EPS = 0.0000000001;
int n, m;
vi a;
map<ll, ll> record;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("in.txt", "r", stdin);
cin >> n >> m;
a.resize(n);
rep(i, 0, n) { cin >> a[i]; }
rep(i, 0, m) {
ll b, c;
cin >> b >> c;
if (record.find(c) != record.end()) {
record[c] += b;
record[c] = min(record[c], (ll)n);
} else {
record[c] = b;
}
}
ll cnt = n;
auto it = record.rbegin();
while (cnt > 0 && it != record.rend()) {
ll b = it->S;
ll c = it->F;
// cout << b << " : " << c << endl;
for (int i = 0; i < b; ++i) {
a.pb(c);
}
cnt -= b;
it++;
}
sort(all(a));
ll total = 0;
per(i, sz(a) - n, sz(a)) { total += (ll)a[i]; }
cout << total << endl;
return 0;
}
| replace | 52 | 53 | 52 | 53 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<ll, ll> pii;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll sum(vector<ll> &a) {
ll ans = 0;
for (auto &x : a)
ans += x;
return ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int 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<pii> ops;
for (int i = 0; i < m; i++) {
ll b, c;
cin >> b >> c;
ops.push_back({c, b});
}
sort(ops.rbegin(), ops.rend());
int lo = 0;
for (int i = 0; i < m && lo < n; i++) {
for (ll j = 0; j < ops[i].second && lo < n; j++) {
if (ops[i].first > a[lo]) {
a[lo] = ops[i].first;
lo++;
}
}
}
cout << sum(a) << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<ll, ll> pii;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll sum(vector<ll> &a) {
ll ans = 0;
for (auto &x : a)
ans += x;
return ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int 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<pii> ops;
for (int i = 0; i < m; i++) {
ll b, c;
cin >> b >> c;
ops.push_back({c, b});
}
sort(ops.rbegin(), ops.rend());
int lo = 0;
for (int i = 0; i < m && lo < n; i++) {
for (ll j = 0; j < ops[i].second && lo < n; j++) {
if (ops[i].first > a[lo]) {
a[lo] = ops[i].first;
lo++;
} else
lo++, j--;
}
}
cout << sum(a) << endl;
return 0;
}
| replace | 59 | 60 | 59 | 61 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<ll> a(n);
vector<tuple<ll, int>> itm;
REP(i, n)
cin >> a[i];
REP(i, m) {
int b;
ll c;
cin >> b >> c;
itm.emplace_back(c, b);
}
sort(ALL(a));
sort(ALL(itm), greater<tuple<ll, int>>());
ll vec_idx = 0;
REP(i, SIZE(itm)) {
// cが新しい数字, bが変更できる数
ll c;
int b;
tie(c, b) = itm[i];
REP(j, b) {
if (a[vec_idx] < c) {
a[vec_idx] = c;
vec_idx++;
}
}
}
ll ans = 0;
REP(i, n)
ans += a[i];
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
// マクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000 // 10^12
#define MOD 10000007 // 10^9+7
#define PB push_back
#define MP make_pair
#define F first
#define S second
int main(int argc, char const *argv[]) {
int n, m;
cin >> n >> m;
vector<ll> a(n);
vector<tuple<ll, int>> itm;
REP(i, n)
cin >> a[i];
REP(i, m) {
int b;
ll c;
cin >> b >> c;
itm.emplace_back(c, b);
}
sort(ALL(a));
sort(ALL(itm), greater<tuple<ll, int>>());
ll vec_idx = 0;
REP(i, SIZE(itm)) {
// cが新しい数字, bが変更できる数
ll c;
int b;
tie(c, b) = itm[i];
REP(j, b) {
if (a[vec_idx] < c) {
a[vec_idx] = c;
vec_idx++;
} else
break;
}
}
ll ans = 0;
REP(i, n)
ans += a[i];
cout << ans << endl;
return 0;
}
| replace | 48 | 49 | 48 | 50 | TLE | |
p03038 | C++ | Runtime Error | #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;
}
| replace | 66 | 67 | 66 | 67 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
vector<pair<int, int>> BC(M);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
for (int i = 0; i < M; ++i) {
cin >> BC[i].first >> BC[i].second;
}
sort(BC.begin(), BC.end(),
[](auto l, auto r) { return l.second > r.second; });
sort(A.begin(), A.end(), [](auto l, auto r) { return l < r; });
int left = 0;
for (int i = 0; i < M; ++i) {
int count = 0;
for (int j = left; j < N; ++j) {
if (A[j] < BC[i].second) {
A[j] = BC[i].second;
++left;
++count;
}
if (count >= BC[i].first)
break;
}
}
long long s = 0;
for (int i = 0; i < N; ++i) {
s += A[i];
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
vector<pair<int, int>> BC(M);
for (int i = 0; i < N; ++i) {
cin >> A[i];
}
for (int i = 0; i < M; ++i) {
cin >> BC[i].first >> BC[i].second;
}
sort(BC.begin(), BC.end(),
[](auto l, auto r) { return l.second > r.second; });
sort(A.begin(), A.end(), [](auto l, auto r) { return l < r; });
int left = 0;
for (int i = 0; i < M; ++i) {
int count = 0;
for (int j = left; j < N; ++j) {
if (A[j] < BC[i].second) {
A[j] = BC[i].second;
++left;
++count;
} else
break;
if (count >= BC[i].first)
break;
}
}
long long s = 0;
for (int i = 0; i < N; ++i) {
s += A[i];
}
cout << s << endl;
}
| replace | 26 | 27 | 26 | 28 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M;
vector<int64_t> A(N);
for (int64_t i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
auto compare = [](pair<int64_t, int64_t> b, pair<int64_t, int64_t> c) {
return b.second < c.second;
};
priority_queue<pair<int64_t, int64_t>, vector<pair<int64_t, int64_t>>,
decltype(compare)>
BC{compare};
for (int64_t i = 0; i < M; i++) {
int64_t tmp_b, tmp_c;
cin >> tmp_b >> tmp_c;
BC.push(make_pair(tmp_b, tmp_c));
}
int64_t sum = 0;
int64_t c_pos = 0;
while (BC.size() > 0) {
auto tmp = BC.top();
BC.pop();
for (int64_t i = 0; i < tmp.first and c_pos < A.size(); i++) {
if (A.at(c_pos) < tmp.second) {
A.at(c_pos) = tmp.second;
c_pos++;
}
}
}
for (int64_t i = 0; i < A.size(); i++) {
sum += A.at(i);
}
cout << sum;
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t N, M;
cin >> N >> M;
vector<int64_t> A(N);
for (int64_t i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
auto compare = [](pair<int64_t, int64_t> b, pair<int64_t, int64_t> c) {
return b.second < c.second;
};
priority_queue<pair<int64_t, int64_t>, vector<pair<int64_t, int64_t>>,
decltype(compare)>
BC{compare};
for (int64_t i = 0; i < M; i++) {
int64_t tmp_b, tmp_c;
cin >> tmp_b >> tmp_c;
BC.push(make_pair(tmp_b, tmp_c));
}
int64_t sum = 0;
int64_t c_pos = 0;
while (BC.size() > 0) {
auto tmp = BC.top();
BC.pop();
for (int64_t i = 0; i < tmp.first and c_pos < A.size(); i++) {
if (A.at(c_pos) < tmp.second) {
A.at(c_pos) = tmp.second;
c_pos++;
} else {
break;
}
}
}
for (int64_t i = 0; i < A.size(); i++) {
sum += A.at(i);
}
cout << sum;
return 0;
}
| insert | 46 | 46 | 46 | 48 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
#define ll long long int
#define all(v) begin(v), end(v)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
// typedef vector<int> V;
// typedef vector<V> VV;
// typedef vector<VV> VVV;
using namespace std;
int main() {
ll n, m, s, t, a, b, c;
vector<ll> vec;
cin >> n >> m;
for (ll i = 0; i < n; i++) {
cin >> a;
vec.push_back(a);
}
sort(vec.begin(), vec.end());
vector<pair<ll, ll>> pairs(m);
for (ll i = 0; i < m; i++) {
cin >> b >> c;
pairs[i] = make_pair(c, b);
}
// firstが小さい順、secondが小さい順にソート
sort(pairs.begin(), pairs.end());
ll flag = 1, index = 0, index2 = m - 1;
while (index2 != -1) {
if (vec[index] > pairs[index2].first || index >= n) {
break;
}
if (vec[index] < pairs[index2].first) {
vec[index] = pairs[index2].first;
index++;
pairs[index2].second--;
}
if (pairs[index2].second <= 0)
index2--;
}
ll sum = 0;
for (ll i = 0; i < n; i++) {
sum += vec[i];
}
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
#define ll long long int
#define all(v) begin(v), end(v)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
// typedef vector<int> V;
// typedef vector<V> VV;
// typedef vector<VV> VVV;
using namespace std;
int main() {
ll n, m, s, t, a, b, c;
vector<ll> vec;
cin >> n >> m;
for (ll i = 0; i < n; i++) {
cin >> a;
vec.push_back(a);
}
sort(vec.begin(), vec.end());
vector<pair<ll, ll>> pairs(m);
for (ll i = 0; i < m; i++) {
cin >> b >> c;
pairs[i] = make_pair(c, b);
}
// firstが小さい順、secondが小さい順にソート
sort(pairs.begin(), pairs.end());
ll flag = 1, index = 0, index2 = m - 1;
while (index2 != -1) {
if (vec[index] > pairs[index2].first || index >= n) {
break;
}
if (vec[index] < pairs[index2].first) {
vec[index] = pairs[index2].first;
index++;
pairs[index2].second--;
} else {
break;
}
if (pairs[index2].second <= 0)
index2--;
}
ll sum = 0;
for (ll i = 0; i < n; i++) {
sum += vec[i];
}
cout << sum << endl;
return 0;
}
| insert | 58 | 58 | 58 | 60 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
ll Mod = 1000000007;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(N);
vector<P> Card(M);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll sum = 0;
for (int i = 0; i < M; i++) {
cin >> Card[i].second >> Card[i].first;
sum += Card[i].second;
}
sort(Card.begin(), Card.end());
reverse(Card.begin(), Card.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
A.push_back(Card[cnt].first);
Card[cnt].second--;
if (Card[cnt].second == 0) {
cnt++;
}
if (i == sum) {
break;
}
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
ll ans = 0;
for (int i = 0; i < N; i++) {
ans += A[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
ll Mod = 1000000007;
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(N);
vector<P> Card(M);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll sum = 0;
for (int i = 0; i < M; i++) {
cin >> Card[i].second >> Card[i].first;
sum += Card[i].second;
}
sort(Card.begin(), Card.end());
reverse(Card.begin(), Card.end());
int cnt = 0;
for (int i = 0; i < N; i++) {
A.push_back(Card[cnt].first);
Card[cnt].second--;
if (Card[cnt].second == 0) {
cnt++;
}
if (i == sum - 1) {
break;
}
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
ll ans = 0;
for (int i = 0; i < N; i++) {
ans += A[i];
}
cout << ans << endl;
return 0;
}
| replace | 27 | 28 | 27 | 28 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin(), X.end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll int data[100000];
int getindex(ll int *data, int lessthanthis, int l, int r) {
if (l == r || l + 1 == r) {
if (data[r] < lessthanthis)
return r;
else if (data[l] < lessthanthis)
return l;
else
return -1;
}
int p = (l + r) / 2;
// cout << " l :" << l << " r: " << r << " p: " << p << endl;
if (data[p] < lessthanthis)
return getindex(data, lessthanthis, p, r);
else
return getindex(data, lessthanthis, l, p);
}
// int main(){
// REP(i, 10) data[i] = i;
// REP(i, 10) cout << data[i] << " ";
// cout << endl;
// cout << getindex(data, 19, 0, 9) << endl;
// }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll int ans = 0;
int n, m;
cin >> n >> m;
REP(i, n) cin >> data[i];
sort(data, data + n);
vector<pair<ll int, int>> vp;
ll int maxc = -1;
REP(i, m) {
int b;
ll int c;
cin >> b >> c;
maxc = max(maxc, c);
c = -1 * c;
vp.push_back(mp(c, b));
}
sort(All(vp));
int target_made = getindex(data, maxc, 0, n - 1);
// cout << "target_made : " << target_made << endl;
int cnt = n;
FOR(i, target_made + 1, n) {
ans += data[i];
cnt--;
}
int target_l = 0;
int rewrite_numsum = 0;
REP(i, vp.size()) {
ll int c = -1 * vp[i].first;
int b = vp[i].second;
// cout << " target_l : " << target_l << " c : " << c << endl;
// cout << " getindex : " << getindex(data, c, target_l, n-1) << endl;
ll int rewrite_num =
min(b, getindex(data, c, target_l, n - 1) - target_l + 1);
// cout << " rewrite_num : " << rewrite_num << " rewrite_to : " << c <<
// endl;
if (rewrite_num < 0)
continue;
target_l += rewrite_num;
ans += rewrite_num * c;
cnt -= rewrite_num;
rewrite_numsum += rewrite_num;
}
// cout << " nokori cnt: " << cnt << endl;
for (int i = rewrite_numsum; i < rewrite_numsum + cnt; i++) {
ans += data[i];
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin(), X.end()
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define shosu(X) fixed << setprecision(X)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll int data[100000];
int getindex(ll int *data, int lessthanthis, int l, int r) {
if (l > r)
return -1;
if (l == r || l + 1 == r) {
if (data[r] < lessthanthis)
return r;
else if (data[l] < lessthanthis)
return l;
else
return -1;
}
int p = (l + r) / 2;
// cout << " l :" << l << " r: " << r << " p: " << p << endl;
if (data[p] < lessthanthis)
return getindex(data, lessthanthis, p, r);
else
return getindex(data, lessthanthis, l, p);
}
// int main(){
// REP(i, 10) data[i] = i;
// REP(i, 10) cout << data[i] << " ";
// cout << endl;
// cout << getindex(data, 19, 0, 9) << endl;
// }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll int ans = 0;
int n, m;
cin >> n >> m;
REP(i, n) cin >> data[i];
sort(data, data + n);
vector<pair<ll int, int>> vp;
ll int maxc = -1;
REP(i, m) {
int b;
ll int c;
cin >> b >> c;
maxc = max(maxc, c);
c = -1 * c;
vp.push_back(mp(c, b));
}
sort(All(vp));
int target_made = getindex(data, maxc, 0, n - 1);
// cout << "target_made : " << target_made << endl;
int cnt = n;
FOR(i, target_made + 1, n) {
ans += data[i];
cnt--;
}
int target_l = 0;
int rewrite_numsum = 0;
REP(i, vp.size()) {
ll int c = -1 * vp[i].first;
int b = vp[i].second;
// cout << " target_l : " << target_l << " c : " << c << endl;
// cout << " getindex : " << getindex(data, c, target_l, n-1) << endl;
ll int rewrite_num =
min(b, getindex(data, c, target_l, n - 1) - target_l + 1);
// cout << " rewrite_num : " << rewrite_num << " rewrite_to : " << c <<
// endl;
if (rewrite_num < 0)
continue;
target_l += rewrite_num;
ans += rewrite_num * c;
cnt -= rewrite_num;
rewrite_numsum += rewrite_num;
}
// cout << " nokori cnt: " << cnt << endl;
for (int i = rewrite_numsum; i < rewrite_numsum + cnt; i++) {
ans += data[i];
}
cout << ans << endl;
} | insert | 19 | 19 | 19 | 21 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int maxn = 100001;
int n, m;
int a[maxn];
struct bbb {
int t;
int num;
};
bbb b[maxn];
bool cmp(bbb x, bbb y) { return x.num > y.num; }
int main() {
long long ans = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
ans += a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i].t >> b[i].num;
}
sort(a, a + n);
sort(b, b + m, cmp);
int c = 0;
for (int i = 0; i < m; i++) {
int cc = c;
for (int j = cc; j < b[i].t + cc; j++) {
if (j == n)
break;
if (a[j] < b[i].num) {
ans += b[i].num - a[j];
c = j + 1;
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int maxn = 100001;
int n, m;
int a[maxn];
struct bbb {
int t;
int num;
};
bbb b[maxn];
bool cmp(bbb x, bbb y) { return x.num > y.num; }
int main() {
long long ans = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
ans += a[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i].t >> b[i].num;
}
sort(a, a + n);
sort(b, b + m, cmp);
int c = 0;
for (int i = 0; i < m; i++) {
int cc = c;
for (int j = cc; j < b[i].t + cc; j++) {
if (j == n)
break;
if (a[j] < b[i].num) {
ans += b[i].num - a[j];
c = j + 1;
} else
break;
}
}
cout << ans << endl;
return 0;
} | replace | 37 | 38 | 37 | 39 | TLE | |
p03038 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define DECIMAL(n) \
std::cout << std::fixed; \
std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14159265358979323844
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define endl "\n"
#define sqr(a) (a) * (a)
#define __lcm(m, n) m *(n / __gcd(m, n))
#define inputarr(a, n) \
for (int xxx = 0; xxx < n; ++xxx) \
cin >> (a)[xxx]
#define sz(a) (int)a.size()
#define sl(a) (int)a.length()
#define display(x) \
for (auto &a : x) \
cout << a << " "; \
cout << endl
#define debug cerr << "bhau" << endl
#define between(n, a, b) (a <= n && n <= b)
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <typename T, typename U> static inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> static inline void amax(T &x, U y) {
if (x < y)
x = y;
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &out, std::pair<T, U> a) {
out << a.fi << " " << a.se;
return out;
}
template <typename T, typename U>
std::istream &operator>>(std::istream &in, std::pair<T, U> &a) {
in >> a.fi >> a.se;
return in;
}
inline long long toint(const std::string &s) {
std::stringstream ss;
ss << s;
long long x;
ss >> x;
return x;
}
inline std::string tostring(long long number) {
std::stringstream ss;
ss << number;
return ss.str();
}
inline std::string tobin(long long x) { return std::bitset<63>(x).to_string(); }
std::mt19937_64
rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pii std::pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define point complex<ll>
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
/*----------------------Graph Moves----------------*/
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*------------------------------------------------*/
// primes for hashing 937,991,1013,1409,1741
using namespace std;
using namespace __gnu_pbds;
#define int long long
void meowmeow321() {
int n, m;
cin >> n >> m;
int a[n];
inputarr(a, n);
pii bc[m];
inputarr(bc, m);
sort(bc, bc + m, [&](pii a, pii b) { return a.se > b.se; });
vi c;
for (int i = 0; i < m; ++i) {
while (sz(c) < n && bc[i].fi > 0) {
bc[i].fi--;
c.pb(bc[i].se);
}
}
sort(a, a + n);
for (int i = 0; i < n; ++i) {
if (a[i] < c[i]) {
a[i] = c[i];
}
}
cout << accumulate(a, a + n, 0ll) << endl;
}
signed main() {
FAST;
int testcases = 1;
// cin>>testcases;
for (int i = 0; i < testcases; ++i) {
meowmeow321();
}
cerr << endl << "Time Elasped : " << elasped_time << endl;
return 0;
} | // #pragma GCC optimize("Ofast")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FAST \
std::ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define DECIMAL(n) \
std::cout << std::fixed; \
std::cout << std::setprecision(n);
#define hell 1000000007
#define narak 998244353
#define PI 3.14159265358979323844
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define endl "\n"
#define sqr(a) (a) * (a)
#define __lcm(m, n) m *(n / __gcd(m, n))
#define inputarr(a, n) \
for (int xxx = 0; xxx < n; ++xxx) \
cin >> (a)[xxx]
#define sz(a) (int)a.size()
#define sl(a) (int)a.length()
#define display(x) \
for (auto &a : x) \
cout << a << " "; \
cout << endl
#define debug cerr << "bhau" << endl
#define between(n, a, b) (a <= n && n <= b)
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
template <typename T, typename U> static inline void amin(T &x, U y) {
if (y < x)
x = y;
}
template <typename T, typename U> static inline void amax(T &x, U y) {
if (x < y)
x = y;
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &out, std::pair<T, U> a) {
out << a.fi << " " << a.se;
return out;
}
template <typename T, typename U>
std::istream &operator>>(std::istream &in, std::pair<T, U> &a) {
in >> a.fi >> a.se;
return in;
}
inline long long toint(const std::string &s) {
std::stringstream ss;
ss << s;
long long x;
ss >> x;
return x;
}
inline std::string tostring(long long number) {
std::stringstream ss;
ss << number;
return ss.str();
}
inline std::string tobin(long long x) { return std::bitset<63>(x).to_string(); }
std::mt19937_64
rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pii std::pair<int, int>
#define vi vector<int>
#define vvi vector<vi>
#define vii vector<pii>
#define point complex<ll>
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
/*----------------------Graph Moves----------------*/
// const int fx[]={+1,-1,+0,+0};
// const int fy[]={+0,+0,+1,-1};
// const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
// const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
// const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*------------------------------------------------*/
// primes for hashing 937,991,1013,1409,1741
using namespace std;
using namespace __gnu_pbds;
#define int long long
void meowmeow321() {
int n, m;
cin >> n >> m;
int a[n];
inputarr(a, n);
pii bc[m];
inputarr(bc, m);
sort(bc, bc + m, [&](pii a, pii b) { return a.se > b.se; });
vi c;
for (int i = 0; i < m; ++i) {
while (sz(c) < n && bc[i].fi > 0) {
bc[i].fi--;
c.pb(bc[i].se);
}
}
sort(a, a + n);
for (int i = 0; i < n && i < sz(c); ++i) {
if (a[i] < c[i]) {
a[i] = c[i];
}
}
cout << accumulate(a, a + n, 0ll) << endl;
}
signed main() {
FAST;
int testcases = 1;
// cin>>testcases;
for (int i = 0; i < testcases; ++i) {
meowmeow321();
}
cerr << endl << "Time Elasped : " << elasped_time << endl;
return 0;
} | replace | 130 | 131 | 130 | 131 | 0 |
Time Elasped : 0.033494
|
p03038 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 2000000007
#define MOD 998244353
#define MAX 100005
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int ll;
template <typename T> void print(vector<T>);
struct S {
int b;
int c;
S() { b = 0, c = 0; }
S(int x1, int x2) {
b = x1;
c = x2;
}
bool operator<(const S &another) const { return c < another.c; };
bool operator>(const S &another) const { return c > another.c; };
};
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
vector<S> BC(M);
REP(i, N) cin >> A[i];
sort(A.begin(), A.end());
REP(i, M) {
int B, C;
cin >> B >> C;
BC[i].b = B;
BC[i].c = C;
}
sort(BC.begin(), BC.end(), greater<S>());
int itr = 0;
REP(i, M) {
REP(j, BC[i].b) {
if (BC[i].c > A[itr])
A[itr] = BC[i].c;
itr++;
}
}
// print(A);
ull cnt = 0;
REP(i, N) cnt += A[i];
cout << cnt << endl;
return 0;
}
template <typename T> void print(vector<T> vec) {
cout << "[";
for (auto itr : vec)
cout << itr << ":";
cout << "]" << endl;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define INF 2000000007
#define MOD 998244353
#define MAX 100005
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int ll;
template <typename T> void print(vector<T>);
struct S {
int b;
int c;
S() { b = 0, c = 0; }
S(int x1, int x2) {
b = x1;
c = x2;
}
bool operator<(const S &another) const { return c < another.c; };
bool operator>(const S &another) const { return c > another.c; };
};
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N);
vector<S> BC(M);
REP(i, N) cin >> A[i];
sort(A.begin(), A.end());
REP(i, M) {
int B, C;
cin >> B >> C;
BC[i].b = B;
BC[i].c = C;
}
sort(BC.begin(), BC.end(), greater<S>());
int itr = 0;
REP(i, M) {
REP(j, BC[i].b) {
if (itr > N)
break;
if (BC[i].c > A[itr])
A[itr] = BC[i].c;
itr++;
}
}
// print(A);
ull cnt = 0;
REP(i, N) cnt += A[i];
cout << cnt << endl;
return 0;
}
template <typename T> void print(vector<T> vec) {
cout << "[";
for (auto itr : vec)
cout << itr << ":";
cout << "]" << endl;
}
| insert | 54 | 54 | 54 | 56 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
static const uint64_t MOD = 1000000007LL;
// uint64_t dp[100005][13];
int main() {
int n, m;
cin >> n >> m;
map<long, long> mcb;
priority_queue<long, vector<long>, greater<long>> q;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
q.push(a);
}
for (int i = 0; i < m; i++) {
long b, c;
cin >> b >> c;
mcb[c] += b;
}
for (auto e : mcb) {
long c = e.first;
long b = e.second;
for (int i = 0; i < b; i++) {
if (q.top() < c) {
q.pop();
q.push(c);
} else {
break;
}
}
}
long ans = 0;
while (!q.empty()) {
ans += q.top();
q.pop();
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
static const uint64_t MOD = 1000000007LL;
// uint64_t dp[100005][13];
int main() {
int n, m;
cin >> n >> m;
map<long, long, greater<long>> mcb;
priority_queue<long, vector<long>, greater<long>> q;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
q.push(a);
}
for (int i = 0; i < m; i++) {
long b, c;
cin >> b >> c;
mcb[c] += b;
}
for (auto e : mcb) {
long c = e.first;
long b = e.second;
for (int i = 0; i < b; i++) {
if (q.top() < c) {
q.pop();
q.push(c);
} else {
break;
}
}
}
long ans = 0;
while (!q.empty()) {
ans += q.top();
q.pop();
}
cout << ans << endl;
}
| replace | 14 | 15 | 14 | 15 | TLE | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef pair<long, long> P;
int main() {
long n, m;
long ans = 0;
cin >> n >> m;
vector<long> a(n);
priority_queue<P> pq;
for (long i = 0; i < n; i++)
cin >> a[i];
for (long i = 0; i < m; i++) {
long b, c;
cin >> b >> c;
pq.push(P(c, b));
}
sort(a.begin(), a.end());
for (long i = 0; i < n; i++) {
long b, c;
tie(c, b) = pq.empty() ? P(-1, -1) : pq.top();
pq.pop();
if (c <= a[i]) {
pq.push(P(c, b));
ans += a[i];
continue;
} else {
ans += c;
if (b - 1 > 0)
pq.push(P(c, b - 1));
}
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef pair<long, long> P;
int main() {
long n, m;
long ans = 0;
cin >> n >> m;
vector<long> a(n);
priority_queue<P> pq;
for (long i = 0; i < n; i++)
cin >> a[i];
for (long i = 0; i < m; i++) {
long b, c;
cin >> b >> c;
pq.push(P(c, b));
}
sort(a.begin(), a.end());
for (long i = 0; i < n; i++) {
long b, c;
if (pq.empty()) {
b = c = -1;
} else {
tie(c, b) = pq.top();
pq.pop();
}
if (c <= a[i]) {
pq.push(P(c, b));
ans += a[i];
continue;
} else {
ans += c;
if (b - 1 > 0)
pq.push(P(c, b - 1));
}
}
cout << ans << endl;
} | replace | 29 | 31 | 29 | 35 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
ll ans = 0;
vector<pair<ll, ll>> ar(n);
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i], ans += a[i];
sort(a, a + n);
for (int i = 0; i < m; i++) {
cin >> ar[i].second >> ar[i].first;
}
sort(ar.begin(), ar.end());
reverse(ar.begin(), ar.end());
int p = 0;
for (int i = 0; i < m; i++) {
while (p < n && ar[i].second && (ar[i].first > a[p])) {
ans += ar[i].first - a[p];
p++;
ar[i].second--;
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
ll ans = 0;
vector<pair<ll, ll>> ar(m);
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i], ans += a[i];
sort(a, a + n);
for (int i = 0; i < m; i++) {
cin >> ar[i].second >> ar[i].first;
}
sort(ar.begin(), ar.end());
reverse(ar.begin(), ar.end());
int p = 0;
for (int i = 0; i < m; i++) {
while (p < n && ar[i].second && (ar[i].first > a[p])) {
ans += ar[i].first - a[p];
p++;
ar[i].second--;
}
}
cout << ans;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03038 | C++ | Runtime Error | #if 0
#endif
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); ++i)
using namespace std;
template <class A> void p(A a) { cout << (a) << endl; }
template <class A, class B> void p(A a, B b) {
cout << a << " ";
p(b);
}
template <class A, class B, class C> void p(A a, B b, C c) {
cout << a << " ";
p(b, c);
}
template <class A, class B, class C, class D> void p(A a, B b, C c, D d) {
cout << a << " ";
p(b, c, d);
}
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
int INF = numeric_limits<int>::max();
// for copy
// for(int i=0;i<N;++i) {
bool sortBySec(pair<int, ll> &a, pair<int, ll> &b) {
return (a.second > b.second);
}
int main(void) {
int N, M;
cin >> N >> M;
ll A[N];
REP(i, N) { cin >> A[i]; }
vector<pair<int, ll>> Buf;
REP(i, M) {
int B, C;
cin >> B >> C;
Buf.push_back(make_pair(B, C));
}
sort(A, A + N);
sort(Buf.begin(), Buf.end(), sortBySec);
// p("=========");
vector<ll> D;
REP(i, M) {
REP(j, Buf[i].first) {
if (D.size() <= N)
D.push_back(Buf[i].second);
else
break;
}
if (D.size() >= N) {
break;
}
}
sort(D.begin(), D.end(), greater<ll>());
// REP(i,D.size()) {
// p(D[i]);
// }
ll sum = 0;
REP(i, N) {
// p(D[i], A[i]);
if (D[i] > A[i]) {
sum += D[i];
} else {
sum += A[i];
}
}
p(sum);
return 0;
}
| #if 0
#endif
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < int(n); ++i)
using namespace std;
template <class A> void p(A a) { cout << (a) << endl; }
template <class A, class B> void p(A a, B b) {
cout << a << " ";
p(b);
}
template <class A, class B, class C> void p(A a, B b, C c) {
cout << a << " ";
p(b, c);
}
template <class A, class B, class C, class D> void p(A a, B b, C c, D d) {
cout << a << " ";
p(b, c, d);
}
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
int INF = numeric_limits<int>::max();
// for copy
// for(int i=0;i<N;++i) {
bool sortBySec(pair<int, ll> &a, pair<int, ll> &b) {
return (a.second > b.second);
}
int main(void) {
int N, M;
cin >> N >> M;
ll A[N];
REP(i, N) { cin >> A[i]; }
vector<pair<int, ll>> Buf;
REP(i, M) {
int B, C;
cin >> B >> C;
Buf.push_back(make_pair(B, C));
}
sort(A, A + N);
sort(Buf.begin(), Buf.end(), sortBySec);
// p("=========");
vector<ll> D;
REP(i, M) {
REP(j, Buf[i].first) {
if (D.size() <= N)
D.push_back(Buf[i].second);
else
break;
}
if (D.size() >= N) {
break;
}
}
sort(D.begin(), D.end(), greater<ll>());
// REP(i,D.size()) {
// p(D[i]);
// }
ll sum = 0;
REP(i, N) {
// p(D[i], A[i]);
if (i < D.size() && D[i] > A[i]) {
sum += D[i];
} else {
sum += A[i];
}
}
p(sum);
return 0;
}
| replace | 74 | 75 | 74 | 75 | 0 | |
p03038 | Python | Runtime Error | def main():
N, M = map(int, input().split())
A = sorted(list(map(int, input().split())))
BC = []
for _ in range(M):
B, C = map(int, input().split())
BC.append((B, C))
BC = sorted(BC, key=lambda x: x[1], reverse=True)
i = 0
for b, c in BC:
for _ in range(b):
if A[i] >= c:
break
A[i] = c
i += 1
print(sum(A))
main()
| def main():
N, M = map(int, input().split())
A = sorted(list(map(int, input().split())))
BC = []
for _ in range(M):
B, C = map(int, input().split())
BC.append((B, C))
BC = sorted(BC, key=lambda x: x[1], reverse=True)
i = 0
for b, c in BC:
for _ in range(b):
if i >= len(A) or A[i] >= c:
break
A[i] = c
i += 1
print(sum(A))
main()
| replace | 11 | 12 | 11 | 12 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
// input
int n, m;
cin >> n >> m;
vector<int> a;
for (int i = 0; i < n; ++i) {
int tmp_a;
cin >> tmp_a;
a.push_back(tmp_a);
}
sort(a.begin(), a.end());
map<int, int> bc;
for (int i = 0; i < m; ++i) {
int tmp_b, tmp_c;
cin >> tmp_b >> tmp_c;
auto itr = bc.find(tmp_c);
if (itr == bc.end()) {
bc[tmp_c] = tmp_b;
} else {
itr->second += tmp_b;
}
}
bool flag = true;
int pt = 0;
for (auto itr = bc.rbegin(); itr != bc.rend(); ++itr) {
int b = itr->second;
int c = itr->first;
for (int i = 0; i < b; i++) {
if (a[pt] < c) {
a[pt] = c;
pt++;
} else {
flag = false;
break;
}
}
if (!flag) {
break;
}
}
long long sum = 0;
for (int i = 0; i < n; ++i) {
sum += a[i];
}
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
// input
int n, m;
cin >> n >> m;
vector<int> a;
for (int i = 0; i < n; ++i) {
int tmp_a;
cin >> tmp_a;
a.push_back(tmp_a);
}
sort(a.begin(), a.end());
map<int, int> bc;
for (int i = 0; i < m; ++i) {
int tmp_b, tmp_c;
cin >> tmp_b >> tmp_c;
auto itr = bc.find(tmp_c);
if (itr == bc.end()) {
bc[tmp_c] = tmp_b;
} else {
itr->second += tmp_b;
}
}
bool flag = true;
int pt = 0;
for (auto itr = bc.rbegin(); itr != bc.rend(); ++itr) {
int b = itr->second;
int c = itr->first;
for (int i = 0; i < b; i++) {
if (a[pt] < c) {
a[pt] = c;
pt++;
if (pt == a.size()) {
flag = false;
break;
}
} else {
flag = false;
break;
}
}
if (!flag) {
break;
}
}
long long sum = 0;
for (int i = 0; i < n; ++i) {
sum += a[i];
}
cout << sum << endl;
return 0;
} | insert | 36 | 36 | 36 | 40 | 0 | |
p03038 | Python | Time Limit Exceeded | from collections import defaultdict
N, M = map(int, input().split())
# Aは昇順に並べる
A = list(sorted(map(int, input().split())))
# B,Cの対応辞書を作り、C順に並べる
counter = defaultdict(int)
for _ in range(M):
B, C = map(int, input().split())
counter[C] += B
c_list = list(sorted(counter.keys(), reverse=True))
# Cを大きい順に個数分並べたリストを作る
moves = []
n = 0
for c in c_list:
b = counter[c]
if n + b < N:
p = b
else:
p = N - n
for i in range(p):
moves.append(c)
# AとCを小さい順に比較
siz = min(N, len(moves))
for i in range(siz):
# Aの小さいものを上書き
A[i] = max(A[i], moves[i])
print(sum(A))
| from collections import defaultdict
N, M = map(int, input().split())
# Aは昇順に並べる
A = list(sorted(map(int, input().split())))
# B,Cの対応辞書を作り、C順に並べる
counter = defaultdict(int)
for _ in range(M):
B, C = map(int, input().split())
counter[C] += B
c_list = list(sorted(counter.keys(), reverse=True))
# Cを大きい順に個数分並べたリストを作る
moves = []
n = 0
for c in c_list:
b = counter[c]
if n + b < N:
p = b
else:
p = N - n
for i in range(p):
moves.append(c)
if len(moves) >= N:
break
# AとCを小さい順に比較
siz = min(N, len(moves))
for i in range(siz):
# Aの小さいものを上書き
A[i] = max(A[i], moves[i])
print(sum(A))
| insert | 24 | 24 | 24 | 26 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> p(m);
REP(i, n) cin >> a[i];
REP(i, m) {
int b, c;
cin >> b >> c;
p[i] = make_pair(c, b);
}
sort(ALL(a));
sort(ALL(p), greater<pair<int, int>>());
ll ans = 0;
int j = 0;
REP(i, n) {
ans += max(a[i], p[j].first);
p[j].second--;
if (p[j].second == 0)
j++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> p(m);
REP(i, n) cin >> a[i];
REP(i, m) {
int b, c;
cin >> b >> c;
p[i] = make_pair(c, b);
}
sort(ALL(a));
sort(ALL(p), greater<pair<int, int>>());
ll ans = 0;
int j = 0;
REP(i, n) {
if (j == p.size()) {
ans += a[i];
continue;
}
ans += max(a[i], p[j].first);
p[j].second--;
if (p[j].second == 0)
j++;
}
cout << ans << endl;
return 0;
} | insert | 25 | 25 | 25 | 29 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> s(100009);
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[i];
for (int i = 0; i < M; i++)
cin >> B[i] >> C[i];
sort(A.begin(), A.end());
vector<pair<long long, long long>> p(M);
for (int i = 0; i < M; i++)
p[i] = make_pair(C[i], B[i]);
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
long long cnt = 0;
for (int i = 0; i < M; i++) {
for (int j = 0; j < p[i].second; j++) {
if (A[cnt] >= p[i].first) {
goto abc;
} else {
A[cnt] = p[i].first;
cnt++;
}
}
}
abc:
long long sum = 0;
for (int i = 0; i < N; i++)
sum += A[i];
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> s(100009);
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[i];
for (int i = 0; i < M; i++)
cin >> B[i] >> C[i];
sort(A.begin(), A.end());
vector<pair<long long, long long>> p(M);
for (int i = 0; i < M; i++)
p[i] = make_pair(C[i], B[i]);
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
long long cnt = 0;
for (int i = 0; i < M; i++) {
for (int j = 0; j < p[i].second; j++) {
if (cnt >= N) {
goto abc;
} else if (A[cnt] >= p[i].first) {
goto abc;
} else {
A[cnt] = p[i].first;
cnt++;
}
}
}
abc:
long long sum = 0;
for (int i = 0; i < N; i++)
sum += A[i];
cout << sum << endl;
} | replace | 21 | 22 | 21 | 24 | 0 | |
p03038 | C++ | Time Limit Exceeded |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <vector>
#ifdef _MSC_VER
#include <intrin.h>
#define popcnt __popcnt64
// # define __builtin_popcount __popcnt
#else
#define popcnt __builtin_popcountll
#endif
// #include "boost/variant.hpp"
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
#define rep(i, N, M) for (ll i = N, i##_len = (M); i < i##_len; ++i)
#define rep_skip(i, N, M, ...) \
for (ll i = N, i##_len = (M); i < i##_len; i += (skip))
#define rrep(i, N, M) for (ll i = (M)-1, i##_len = (N - 1); i > i##_len; --i)
#define pb push_back
typedef pair<double, double> pd;
typedef pair<ll, ll> pll;
template <int n> struct tll_impl {
using type = decltype(tuple_cat(tuple<ll>(),
declval<typename tll_impl<n - 1>::type>()));
};
template <> struct tll_impl<1> {
using type = tuple<ll>;
};
template <int n> using tll = typename tll_impl<n>::type;
template <class T> constexpr ll SZ(T &v) { return static_cast<ll>(v.size()); };
template <int n, typename T> struct vec_t_impl {
using type = vector<typename vec_t_impl<n - 1, T>::type>;
};
template <typename T> struct vec_t_impl<1, T> {
using type = vector<T>;
};
template <int n, typename T> using vec_t = typename vec_t_impl<n, T>::type;
// check
static_assert(is_same<vec_t<3, ll>, vector<vector<vector<ll>>>>::value, "");
// decompose vector into basetype and dimension.
template <typename T> struct vec_dec {
static constexpr int dim = 0;
using type = T;
};
template <typename T> struct vec_dec<vector<T>> {
static constexpr int dim = vec_dec<T>::dim + 1;
using type = typename vec_dec<T>::type;
};
static_assert(is_same<typename vec_dec<vec_t<3, ll>>::type, ll>::value, "");
static_assert(vec_dec<vec_t<3, ll>>::dim == 3, "");
template <typename T = ll> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T = ll, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// ex: auto dp = make_v<ll>(4,5) => vector<vector<ll>> dp(4,vector<ll>(5));
// check if T is vector
template <typename T> struct is_vector : std::false_type {};
template <typename T> struct is_vector<vector<T>> : std::true_type {};
static_assert(is_vector<vector<ll>>::value == true &&
is_vector<ll>::value == false,
"");
// check if T is vector
template <typename T> struct is_pair : std::false_type {};
template <typename T, typename S>
struct is_pair<pair<T, S>> : std::true_type {};
static_assert(is_pair<pll>::value == true && is_pair<ll>::value == false, "");
template <typename T, typename V,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
for (auto &&x : t)
fill_v(x, v);
}
// ex: fill_v(dp, INF);
template <typename T,
typename enable_if<!is_vector<T>::value && !is_pair<T>::value,
nullptr_t>::type = nullptr>
void read_v(T &x) {
cin >> x;
}
template <typename T,
typename enable_if<is_pair<T>::value, nullptr_t>::type = nullptr>
void read_v(T &x) {
read_v(x.first);
read_v(x.second);
}
template <typename T,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void read_v(T &x) {
rep(i, 0, x.size()) read_v(x[i]);
}
template <typename T, typename Delim_t = string,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void write_v(T &x, Delim_t delim = " ") {
cout << x << delim;
}
template <typename T, typename Delim_t = string,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void write_v(T &x, Delim_t delim = " ") {
rep(i, 0, x.size()) write_v(x[i]);
cout << endl;
}
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
template <typename T>
using pq_greater = priority_queue<T, vector<T>, greater<T>>;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define perm(c) \
sort(all(c)); \
for (bool c##perm = 1; c##perm; c##perm = next_permutation(all(c)))
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
vll seq(ll i, ll j) {
vll res(j - i);
rep(k, i, j) res[k] = i + k;
return res;
}
constexpr ll POW_0(ll x, ll y) {
if (y == 0)
return 1;
if (y == 1)
return x;
if (y == 2)
return x * x;
if (y % 2 == 0)
return POW_0(POW_0(x, y / 2), 2LL);
return ((POW_0(POW_0(x, y / 2), 2LL)) * (x));
}
constexpr ll POW(ll x, ll y, ll mod = MOD) {
if (mod == 0)
return POW_0(x, y);
if (y == 0)
return 1;
if (y == 1)
return x % mod;
if (y == 2)
return x * x % mod;
if (y % 2 == 0)
return POW(POW(x, y / 2, mod), 2LL, mod) % mod;
return ((POW(POW(x, y / 2, mod), 2LL, mod)) * (x % mod)) % mod;
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void sort_by(Inputs &inputs, Functor f) {
std::sort(std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void stable_sort_by(Inputs &inputs, Functor f) {
std::stable_sort(
std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
// ============================ Header =================================
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
pq_greater<ll> pq;
ll n, m;
cin >> n >> m;
vll a(n);
vpll bc(m);
read_v(a);
rep(i, 0, n) pq.push(a[i]);
read_v(bc);
sort_by(bc, [](pll p) { return p.second; });
ll sum = 0;
rrep(i, 0, m) {
ll b = bc[i].first;
ll c = bc[i].second;
rep(i, 0, b) {
ll x = pq.top();
if (x < c) {
sum += c;
pq.pop();
} else {
break;
}
}
}
while (pq.size()) {
ll x = pq.top();
pq.pop();
sum += x;
}
cout << sum << endl;
return 0;
}
|
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <vector>
#ifdef _MSC_VER
#include <intrin.h>
#define popcnt __popcnt64
// # define __builtin_popcount __popcnt
#else
#define popcnt __builtin_popcountll
#endif
// #include "boost/variant.hpp"
using namespace std;
typedef long long ll;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
#define rep(i, N, M) for (ll i = N, i##_len = (M); i < i##_len; ++i)
#define rep_skip(i, N, M, ...) \
for (ll i = N, i##_len = (M); i < i##_len; i += (skip))
#define rrep(i, N, M) for (ll i = (M)-1, i##_len = (N - 1); i > i##_len; --i)
#define pb push_back
typedef pair<double, double> pd;
typedef pair<ll, ll> pll;
template <int n> struct tll_impl {
using type = decltype(tuple_cat(tuple<ll>(),
declval<typename tll_impl<n - 1>::type>()));
};
template <> struct tll_impl<1> {
using type = tuple<ll>;
};
template <int n> using tll = typename tll_impl<n>::type;
template <class T> constexpr ll SZ(T &v) { return static_cast<ll>(v.size()); };
template <int n, typename T> struct vec_t_impl {
using type = vector<typename vec_t_impl<n - 1, T>::type>;
};
template <typename T> struct vec_t_impl<1, T> {
using type = vector<T>;
};
template <int n, typename T> using vec_t = typename vec_t_impl<n, T>::type;
// check
static_assert(is_same<vec_t<3, ll>, vector<vector<vector<ll>>>>::value, "");
// decompose vector into basetype and dimension.
template <typename T> struct vec_dec {
static constexpr int dim = 0;
using type = T;
};
template <typename T> struct vec_dec<vector<T>> {
static constexpr int dim = vec_dec<T>::dim + 1;
using type = typename vec_dec<T>::type;
};
static_assert(is_same<typename vec_dec<vec_t<3, ll>>::type, ll>::value, "");
static_assert(vec_dec<vec_t<3, ll>>::dim == 3, "");
template <typename T = ll> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T = ll, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
// ex: auto dp = make_v<ll>(4,5) => vector<vector<ll>> dp(4,vector<ll>(5));
// check if T is vector
template <typename T> struct is_vector : std::false_type {};
template <typename T> struct is_vector<vector<T>> : std::true_type {};
static_assert(is_vector<vector<ll>>::value == true &&
is_vector<ll>::value == false,
"");
// check if T is vector
template <typename T> struct is_pair : std::false_type {};
template <typename T, typename S>
struct is_pair<pair<T, S>> : std::true_type {};
static_assert(is_pair<pll>::value == true && is_pair<ll>::value == false, "");
template <typename T, typename V,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
for (auto &&x : t)
fill_v(x, v);
}
// ex: fill_v(dp, INF);
template <typename T,
typename enable_if<!is_vector<T>::value && !is_pair<T>::value,
nullptr_t>::type = nullptr>
void read_v(T &x) {
cin >> x;
}
template <typename T,
typename enable_if<is_pair<T>::value, nullptr_t>::type = nullptr>
void read_v(T &x) {
read_v(x.first);
read_v(x.second);
}
template <typename T,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void read_v(T &x) {
rep(i, 0, x.size()) read_v(x[i]);
}
template <typename T, typename Delim_t = string,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void write_v(T &x, Delim_t delim = " ") {
cout << x << delim;
}
template <typename T, typename Delim_t = string,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void write_v(T &x, Delim_t delim = " ") {
rep(i, 0, x.size()) write_v(x[i]);
cout << endl;
}
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
template <typename T>
using pq_greater = priority_queue<T, vector<T>, greater<T>>;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define perm(c) \
sort(all(c)); \
for (bool c##perm = 1; c##perm; c##perm = next_permutation(all(c)))
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
vll seq(ll i, ll j) {
vll res(j - i);
rep(k, i, j) res[k] = i + k;
return res;
}
constexpr ll POW_0(ll x, ll y) {
if (y == 0)
return 1;
if (y == 1)
return x;
if (y == 2)
return x * x;
if (y % 2 == 0)
return POW_0(POW_0(x, y / 2), 2LL);
return ((POW_0(POW_0(x, y / 2), 2LL)) * (x));
}
constexpr ll POW(ll x, ll y, ll mod = MOD) {
if (mod == 0)
return POW_0(x, y);
if (y == 0)
return 1;
if (y == 1)
return x % mod;
if (y == 2)
return x * x % mod;
if (y % 2 == 0)
return POW(POW(x, y / 2, mod), 2LL, mod) % mod;
return ((POW(POW(x, y / 2, mod), 2LL, mod)) * (x % mod)) % mod;
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void sort_by(Inputs &inputs, Functor f) {
std::sort(std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void stable_sort_by(Inputs &inputs, Functor f) {
std::stable_sort(
std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
// ============================ Header =================================
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
pq_greater<ll> pq;
ll n, m;
cin >> n >> m;
vll a(n);
vpll bc(m);
read_v(a);
rep(i, 0, n) pq.push(a[i]);
read_v(bc);
sort_by(bc, [](pll p) { return p.second; });
ll sum = 0;
rrep(i, 0, m) {
ll b = bc[i].first;
ll c = bc[i].second;
rep(i, 0, b) {
ll x = pq.top();
if (x < c) {
sum += c;
pq.pop();
if (pq.size() == 0) {
cout << sum << endl;
return 0;
}
} else {
break;
}
}
}
while (pq.size()) {
ll x = pq.top();
pq.pop();
sum += x;
}
cout << sum << endl;
return 0;
}
| insert | 247 | 247 | 247 | 251 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
const ll INF = 1e18;
const int inf = 1e9;
bool sortbysecond(ii a, ii b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
vector<ii> q;
for (int i = 0; i < m; i++) {
int b, c;
cin >> b >> c;
q.push_back(ii(b, c));
}
sort(q.begin(), q.end(), sortbysecond);
int k = 0;
for (int i = m - 1; i >= 0; i--) {
int b = q[i].first;
int c = q[i].second;
for (int j = 0; j < b; j++) {
if (a[k] < c) {
a[k] = c;
k++;
}
}
}
ll sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
cout << sum << endl;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
const ll INF = 1e18;
const int inf = 1e9;
bool sortbysecond(ii a, ii b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
vector<ii> q;
for (int i = 0; i < m; i++) {
int b, c;
cin >> b >> c;
q.push_back(ii(b, c));
}
sort(q.begin(), q.end(), sortbysecond);
int k = 0;
for (int i = m - 1; i >= 0; i--) {
int b = q[i].first;
int c = q[i].second;
for (int j = 0; j < b; j++) {
if (a[k] >= c)
break;
a[k] = c;
k++;
}
}
ll sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
}
cout << sum << endl;
}
int main() {
solve();
return 0;
}
| replace | 37 | 41 | 37 | 41 | TLE | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> V;
typedef vector<V> VV;
int main() {
// Happy hacking!
ll n, m;
V a;
ll replace_idx = 0;
vector<pair<ll, ll>> bc;
cin >> n >> m;
for (ll i = 0; i < n; i++) {
ll t;
cin >> t;
a.push_back(t);
}
for (ll i = 0; i < m; i++) {
ll bt, ct;
cin >> bt >> ct;
bc.push_back(make_pair(bt, ct));
}
sort(a.begin(), a.end());
sort(bc.begin(), bc.end(),
[](auto x, auto y) { return x.second > y.second; });
for (auto itr = bc.begin(); itr != bc.end(); itr++) {
ll n_replace = itr->first;
for (ll i = 0; i < n_replace; i++) {
if (a[replace_idx] >= itr->second)
break;
a[replace_idx] = itr->second;
replace_idx++;
}
}
ll res = 0;
for (auto itr = a.begin(); itr != a.end(); itr++) {
res += *itr;
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<ll> V;
typedef vector<V> VV;
int main() {
// Happy hacking!
ll n, m;
V a;
ll replace_idx = 0;
vector<pair<ll, ll>> bc;
cin >> n >> m;
for (ll i = 0; i < n; i++) {
ll t;
cin >> t;
a.push_back(t);
}
for (ll i = 0; i < m; i++) {
ll bt, ct;
cin >> bt >> ct;
bc.push_back(make_pair(bt, ct));
}
sort(a.begin(), a.end());
sort(bc.begin(), bc.end(),
[](auto x, auto y) { return x.second > y.second; });
for (auto itr = bc.begin(); itr != bc.end(); itr++) {
ll n_replace = itr->first;
for (ll i = 0; i < n_replace; i++) {
// cout << replace_idx << endl;
if (replace_idx >= n)
break;
if (a[replace_idx] >= itr->second)
break;
a[replace_idx] = itr->second;
replace_idx++;
}
}
ll res = 0;
for (auto itr = a.begin(); itr != a.end(); itr++) {
res += *itr;
}
cout << res << endl;
return 0;
}
| insert | 38 | 38 | 38 | 41 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
ll mod = 1000000007;
ll INF = 1000000099;
void secondsort(vector<pair<ll, ll>> &v) {
for (ll i = 0; i < v.size(); i++) {
swap(v.at(i).first, v.at(i).second);
}
sort(v.begin(), v.end());
for (ll i = 0; i < v.size(); i++) {
swap(v.at(i).first, v.at(i).second);
}
}
signed main() {
ll n, m, ans = 0;
cin >> n >> m;
priority_queue<ll, vector<ll>, greater<ll>> q;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
q.push(x);
}
vector<pair<ll, ll>> v(m);
for (ll i = 0; i < m; i++) {
cin >> v.at(i).fi >> v.at(i).se;
}
secondsort(v);
/*for(int i=0;i < m;i++)
{
ll l=0,r=v.at(i).fi-1;
while(abs(r-l)>1){
ll mid=(l+r)/2;
if(q.at(mid)>v.at(i).se){
r=mid;
}else{
l=mid;
}
}
for(int j=0;j <=l ;j++)
{
q.at(0)=v.at(i).se;
}
}*/
bool flag = false;
for (int i = 0; i < m; i++) {
for (int j = 0; j < v.at(i).fi; j++) {
if (v.at(i).se > (ll)q.top()) {
q.pop();
q.push(v.at(i).se);
} else {
break;
flag = true;
}
}
if (flag) {
break;
}
}
for (int i = 0; i < n; i++) {
ans += q.top();
q.pop();
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(v) (v).begin(), (v).end()
ll mod = 1000000007;
ll INF = 1000000099;
void secondsort(vector<pair<ll, ll>> &v) {
for (ll i = 0; i < v.size(); i++) {
swap(v.at(i).first, v.at(i).second);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (ll i = 0; i < v.size(); i++) {
swap(v.at(i).first, v.at(i).second);
}
}
signed main() {
ll n, m, ans = 0;
cin >> n >> m;
priority_queue<ll, vector<ll>, greater<ll>> q;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
q.push(x);
}
vector<pair<ll, ll>> v(m);
for (ll i = 0; i < m; i++) {
cin >> v.at(i).fi >> v.at(i).se;
}
secondsort(v);
/*for(int i=0;i < m;i++)
{
ll l=0,r=v.at(i).fi-1;
while(abs(r-l)>1){
ll mid=(l+r)/2;
if(q.at(mid)>v.at(i).se){
r=mid;
}else{
l=mid;
}
}
for(int j=0;j <=l ;j++)
{
q.at(0)=v.at(i).se;
}
}*/
bool flag = false;
for (int i = 0; i < m; i++) {
for (int j = 0; j < v.at(i).fi; j++) {
if (v.at(i).se > (ll)q.top()) {
q.pop();
q.push(v.at(i).se);
} else {
break;
flag = true;
}
}
if (flag) {
break;
}
}
for (int i = 0; i < n; i++) {
ans += q.top();
q.pop();
}
cout << ans << endl;
}
| insert | 15 | 15 | 15 | 16 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),
make_pair(0, -1)};
vector<int> init(int size) {
vector<int> par(size, -1);
return par;
}
int root(int x, vector<int> &par) {
if (par[x] < 0) {
return x;
} else {
return par[x] = root(par[x], par);
}
}
bool same(int x, int y, vector<int> &par) {
return root(x, par) == root(y, par);
}
void unite(int x, int y, vector<int> &par) {
x = root(x, par), y = root(y, par);
if (same(x, y, par))
return;
par[x] += par[y];
par[y] = x;
}
int size(int x, vector<int> &par) { return -par[root(x, par)]; }
int pow(int x, int n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return pow(x * x % MOD, n / 2);
else
return x * pow(x, n - 1) % MOD;
}
signed main() {
int n, m;
cin >> n >> m;
vector<int> ac(1, 0);
int ans = 0, bcsum = 0;
rep(i, n) {
int a;
cin >> a;
ac.push_back(a);
ans += a;
}
sort(ac.begin(), ac.end());
rep(i, n) ac[i + 1] += ac[i];
vector<pair<int, int>> ps;
rep(i, m) {
int b, c;
cin >> b >> c;
ps.push_back(make_pair(c, b));
}
sort(ps.begin(), ps.end(), greater<pair<int, int>>());
int ind = 0;
rep(i, m) {
bool end = false;
rep(j, ps[i].second) {
ind++;
bcsum += ps[i].first;
// cout << bcsum << " " << ac[n] << " " << ac[ind] << " " << bcsum + ac[n]
// - ac[ind] << endl;
if (ans > bcsum + ac[n] - ac[ind]) {
end = true;
break;
} else {
ans = bcsum + ac[n] - ac[ind];
}
}
if (end)
break;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define int long long
typedef long long ll;
using namespace std;
const int MOD = 1000000007;
const int INF = 1010000000;
const double EPS = 1e-10;
const pair<int, int> fd[] = {make_pair(1, 0), make_pair(-1, 0), make_pair(0, 1),
make_pair(0, -1)};
vector<int> init(int size) {
vector<int> par(size, -1);
return par;
}
int root(int x, vector<int> &par) {
if (par[x] < 0) {
return x;
} else {
return par[x] = root(par[x], par);
}
}
bool same(int x, int y, vector<int> &par) {
return root(x, par) == root(y, par);
}
void unite(int x, int y, vector<int> &par) {
x = root(x, par), y = root(y, par);
if (same(x, y, par))
return;
par[x] += par[y];
par[y] = x;
}
int size(int x, vector<int> &par) { return -par[root(x, par)]; }
int pow(int x, int n) {
if (n == 0)
return 1;
if (n % 2 == 0)
return pow(x * x % MOD, n / 2);
else
return x * pow(x, n - 1) % MOD;
}
signed main() {
int n, m;
cin >> n >> m;
vector<int> ac(1, 0);
int ans = 0, bcsum = 0;
rep(i, n) {
int a;
cin >> a;
ac.push_back(a);
ans += a;
}
sort(ac.begin(), ac.end());
rep(i, n) ac[i + 1] += ac[i];
vector<pair<int, int>> ps;
rep(i, m) {
int b, c;
cin >> b >> c;
ps.push_back(make_pair(c, b));
}
sort(ps.begin(), ps.end(), greater<pair<int, int>>());
int ind = 0;
rep(i, m) {
bool end = false;
rep(j, ps[i].second) {
ind++;
if (ind > n) {
end = true;
break;
}
bcsum += ps[i].first;
// cout << bcsum << " " << ac[n] << " " << ac[ind] << " " << bcsum + ac[n]
// - ac[ind] << endl;
if (ans > bcsum + ac[n] - ac[ind]) {
end = true;
break;
} else {
ans = bcsum + ac[n] - ac[ind];
}
}
if (end)
break;
}
cout << ans << endl;
}
| insert | 74 | 74 | 74 | 78 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long int, long long int> change;
bool pairCompare(const change &x, const change &y) {
return x.second > y.second;
}
int main() {
int n, m;
cin >> n >> m;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
vector<change> bc(m);
for (int i = 0; i < m; i++) {
scanf("%d", &bc[i].first);
scanf("%d", &bc[i].second);
}
sort(a.begin(), a.end());
sort(bc.begin(), bc.end(), pairCompare);
int prog = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < bc[i].first; j++) {
if (prog < n) {
if (a[prog] >= bc[i].second)
break;
a[prog] = bc[i].second;
prog++;
}
}
}
long long int ans = 0;
/*
for (auto itr = a.begin(); itr != a.end(); itr++) {
ans += *itr;
}*/
for (int i = 0; i < n; i++) {
ans += a[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long int, long long int> change;
bool pairCompare(const change &x, const change &y) {
return x.second > y.second;
}
int main() {
int n, m;
cin >> n >> m;
vector<long long int> a(n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
vector<change> bc(m);
for (int i = 0; i < m; i++) {
scanf("%d", &bc[i].first);
scanf("%d", &bc[i].second);
}
sort(a.begin(), a.end());
sort(bc.begin(), bc.end(), pairCompare);
int prog = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < bc[i].first; j++) {
// if (prog < n) {
if (a[prog] >= bc[i].second)
break;
a[prog] = bc[i].second;
prog++;
//}
}
}
long long int ans = 0;
/*
for (auto itr = a.begin(); itr != a.end(); itr++) {
ans += *itr;
}*/
for (int i = 0; i < n; i++) {
ans += a[i];
}
cout << ans << endl;
return 0;
} | replace | 31 | 37 | 31 | 37 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<ll, ll>;
ll n, m;
int main() {
cin >> n >> m;
vector<ll> a(n);
rep(i, n) { cin >> a[i]; }
vector<P> bc(n);
rep(i, m) { cin >> bc[i].second >> bc[i].first; }
sort(a.begin(), a.end());
sort(bc.rbegin(), bc.rend());
ll bcind = 0;
rep(i, n) {
if (a[i] >= bc[bcind].first)
break;
a[i] = bc[bcind].first;
bc[bcind].second--;
if (bc[bcind].second == 0)
bcind++;
if (bcind == m)
break;
}
ll ans = 0;
rep(i, n) { ans += a[i]; }
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<ll, ll>;
ll n, m;
int main() {
cin >> n >> m;
vector<ll> a(n);
rep(i, n) { cin >> a[i]; }
vector<P> bc(m);
rep(i, m) { cin >> bc[i].second >> bc[i].first; }
sort(a.begin(), a.end());
sort(bc.rbegin(), bc.rend());
ll bcind = 0;
rep(i, n) {
if (a[i] >= bc[bcind].first)
break;
a[i] = bc[bcind].first;
bc[bcind].second--;
if (bc[bcind].second == 0)
bcind++;
if (bcind == m)
break;
}
ll ans = 0;
rep(i, n) { ans += a[i]; }
cout << ans << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
struct cardchange {
long B;
long C;
cardchange(int B2, int C2) {
B = B2;
C = C2;
}
bool operator<(const cardchange &another) const { return C < another.C; }
};
int main() {
long N, M;
std::cin >> N >> M;
std::vector<long> A;
for (long i = 0; i < N; i++) {
long temp;
std::cin >> temp;
A.push_back(temp);
}
std::sort(A.begin(), A.end());
std::vector<cardchange> changes;
for (long i = 0; i < M; i++) {
long tempb, tempc;
std::cin >> tempb >> tempc;
changes.push_back(cardchange(tempb, tempc));
}
std::sort(changes.begin(), changes.end());
long vs = M - 1;
long changed_num = 0;
for (long i = 0; i < N; i++) {
if (A[i] < changes[vs].C && vs >= 0) {
A[i] = changes[vs].C;
changed_num++;
}
if (changed_num == changes[vs].B) {
vs--;
changed_num = 0;
}
}
long sum = 0;
for (long i = 0; i < N; i++) {
sum += A[i];
}
std::cout << sum << std::endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
struct cardchange {
long B;
long C;
cardchange(int B2, int C2) {
B = B2;
C = C2;
}
bool operator<(const cardchange &another) const { return C < another.C; }
};
int main() {
long N, M;
std::cin >> N >> M;
std::vector<long> A;
for (long i = 0; i < N; i++) {
long temp;
std::cin >> temp;
A.push_back(temp);
}
std::sort(A.begin(), A.end());
std::vector<cardchange> changes;
for (long i = 0; i < M; i++) {
long tempb, tempc;
std::cin >> tempb >> tempc;
changes.push_back(cardchange(tempb, tempc));
}
std::sort(changes.begin(), changes.end());
long vs = M - 1;
long changed_num = 0;
for (long i = 0; i < N; i++) {
if (vs >= 0) {
if (A[i] < changes[vs].C) {
A[i] = changes[vs].C;
changed_num++;
}
if (changed_num == changes[vs].B) {
vs--;
changed_num = 0;
}
}
}
long sum = 0;
for (long i = 0; i < N; i++) {
sum += A[i];
}
std::cout << sum << std::endl;
return 0;
} | replace | 37 | 44 | 37 | 46 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, M;
cin >> N >> M;
int64_t v = 0;
vector<int64_t> A(N);
vector<vector<int>> X(N, vector<int>(2));
for (int64_t i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end());
for (int64_t i = 0; i < M; i++) {
cin >> X[i][1] >> X[i][0];
v += X[i][1];
}
sort(X.begin(), X.end());
reverse(X.begin(), X.end());
v = min(v, N);
vector<int64_t> D;
for (int i = 0; i < N; i++) {
if (D.size() == v)
break;
for (int j = 0; j < X[i][1]; j++) {
D.push_back(X[i][0]);
if (D.size() == v)
break;
}
}
/*for(int i=0;i<v;i++)
cout<<D[i];*/
int64_t answer = 0;
for (int i = 0; i < N; i++) {
if (i < v)
answer += max(A[i], D[i]);
else
answer += A[i];
}
cout << answer;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N, M;
cin >> N >> M;
int64_t v = 0;
vector<int64_t> A(N);
vector<vector<int>> X(M, vector<int>(2));
for (int64_t i = 0; i < N; i++)
cin >> A[i];
sort(A.begin(), A.end());
for (int64_t i = 0; i < M; i++) {
cin >> X[i][1] >> X[i][0];
v += X[i][1];
}
sort(X.begin(), X.end());
reverse(X.begin(), X.end());
v = min(v, N);
vector<int64_t> D;
for (int i = 0; i < N; i++) {
if (D.size() == v)
break;
for (int j = 0; j < X[i][1]; j++) {
D.push_back(X[i][0]);
if (D.size() == v)
break;
}
}
/*for(int i=0;i<v;i++)
cout<<D[i];*/
int64_t answer = 0;
for (int i = 0; i < N; i++) {
if (i < v)
answer += max(A[i], D[i]);
else
answer += A[i];
}
cout << answer;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> bc(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int b, c;
for (int i = 0; i < m; i++) {
cin >> b >> c;
bc[i] = make_pair(c, b);
}
sort(bc.begin(), bc.end());
reverse(bc.begin(), bc.end());
int buf = 0;
long long sum = 0;
auto itr = bc.begin();
for (int i = 0; i < n; i++) {
if (itr->first <= a[i])
break;
a[i] = itr->first;
if (--itr->second == 0)
itr++;
}
for (int i = 0; i < n; i++) {
sum += a[i];
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> bc(m);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int b, c;
for (int i = 0; i < m; i++) {
cin >> b >> c;
bc[i] = make_pair(c, b);
}
sort(bc.begin(), bc.end());
reverse(bc.begin(), bc.end());
int buf = 0;
long long sum = 0;
auto itr = bc.begin();
for (int i = 0; i < n; i++) {
if (itr->first <= a[i])
break;
a[i] = itr->first;
if (--itr->second == 0)
itr++;
if (itr == bc.end())
break;
}
for (int i = 0; i < n; i++) {
sum += a[i];
}
cout << sum << endl;
return 0;
}
| insert | 33 | 33 | 33 | 35 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define PI (acos(-1))
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e15;
const int INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<Pi> b(m);
rep(i, m) { cin >> b[i].se >> b[i].fi; }
sort(begin(b), end(b), greater<Pi>());
bool flag = false;
rep(i, n) {
rep(j, b[i].se) {
if (a.size() != 2 * n) {
a.push_back(b[i].fi);
} else {
flag = true;
break;
}
}
if (flag)
break;
}
sort(begin(a), end(a), greater<int>());
ll ans = 0;
rep(i, n) { ans += a[i]; }
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define PI (acos(-1))
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ostream &operator<<(ostream &s, const complex<T> &d) {
return s << "(" << d.real() << ", " << d.imag() << ")";
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &d) {
return s << "(" << d.first << ", " << d.second << ")";
}
template <typename T> ostream &operator<<(ostream &s, const vector<T> &d) {
int len = d.size();
rep(i, len) {
s << d[i];
if (i < len - 1)
s << " ";
}
return s;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &d) {
int len = d.size();
rep(i, len) { s << d[i] << endl; }
return s;
}
template <typename T> ostream &operator<<(ostream &s, const set<T> &v) {
s << "{ ";
for (auto itr = v.begin(); itr != v.end(); ++itr) {
if (itr != v.begin()) {
s << ", ";
}
s << (*itr);
}
s << " }";
return s;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const map<T1, T2> &m) {
s << "{" << endl;
for (auto itr = m.begin(); itr != m.end(); ++itr) {
s << " " << (*itr).first << " : " << (*itr).second << endl;
}
s << "}" << endl;
return s;
}
const ll mod = 1e9 + 7;
const ll inf = 1e15;
const int INF = 1e9;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
vector<Pi> b(m);
rep(i, m) { cin >> b[i].se >> b[i].fi; }
sort(begin(b), end(b), greater<Pi>());
bool flag = false;
rep(i, m) {
rep(j, b[i].se) {
if (a.size() != 2 * n) {
a.push_back(b[i].fi);
} else {
flag = true;
break;
}
}
if (flag)
break;
}
sort(begin(a), end(a), greater<int>());
ll ans = 0;
rep(i, n) { ans += a[i]; }
cout << ans << endl;
} | replace | 84 | 85 | 84 | 85 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define drep2(j, n) for (int j = (n)-1; j >= 0; --j)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; j < t; ++j)
#define srep3(k, s, t) for (int k = s; k < t; ++k)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int main() {
int N, M;
cin >> N >> M;
vi A(N);
rep(i, N) { cin >> A[i]; }
sort(rng(A));
vp B(M);
vi card(N, 0);
rep(i, M) {
int b, c;
cin >> b >> c;
B[i] = P(b, c);
}
sort(rng(B), [](P &l, P &r) { return l.second > r.second; });
int f = 0;
vi D(N);
rep(i, M) {
rep(j, B[i].first) { D[f + j] = B[i].second; }
f += B[i].first;
}
ll ans = 0;
rep(i, N) { ans += max(D[i], A[i]); }
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(j, n) for (int j = 0; j < (n); ++j)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define drep2(j, n) for (int j = (n)-1; j >= 0; --j)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define srep2(j, s, t) for (int j = s; j < t; ++j)
#define srep3(k, s, t) for (int k = s; k < t; ++k)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame \
{ \
puts("-1"); \
return 0; \
}
#define yn \
{ puts("YES"); } \
else { \
puts("NO"); \
}
int main() {
int N, M;
cin >> N >> M;
vi A(N);
rep(i, N) { cin >> A[i]; }
sort(rng(A));
vp B(M);
vi card(N, 0);
rep(i, M) {
int b, c;
cin >> b >> c;
B[i] = P(b, c);
}
sort(rng(B), [](P &l, P &r) { return l.second > r.second; });
int f = 0;
vi D(N);
rep(i, M) {
rep(j, B[i].first) {
if (f + j > N)
break;
D[f + j] = B[i].second;
}
if (f + B[i].first - 1 > N)
break;
f += B[i].first;
}
ll ans = 0;
rep(i, N) { ans += max(D[i], A[i]); }
cout << ans << endl;
return 0;
} | replace | 77 | 78 | 77 | 84 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
/*for(int i=0; i<n; i++){
cout << a.at(i) << endl;
}
cout << endl;*/
vector<tuple<int, int>> bc(m);
int b, c;
for (int i = 0; i < m; i++) {
cin >> b >> c;
bc.at(i) = make_tuple(c, b);
}
sort(bc.begin(), bc.end(), greater<>());
/*for(int i=0; i<m; i++){
cout << get<0>(bc.at(i)) << ' ' << get<1>(bc.at(i)) << endl;
}
cout << endl;*/
int i = 0, j = 0;
while (1) {
if (a.at(i) < get<0>(bc.at(j))) {
a.at(i) = get<0>(bc.at(j));
get<1>(bc.at(j))--;
if (get<1>(bc.at(j)) == 0)
j++;
}
i++;
if (i == n - 1)
break;
// cout << get<0>(bc.at(0)) << ' ' << get<1>(bc.at(0)) << endl;
// cout << a.at(i) << endl;
}
long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += a.at(i);
// cout << ans << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
/*for(int i=0; i<n; i++){
cout << a.at(i) << endl;
}
cout << endl;*/
vector<tuple<int, int>> bc(m);
int b, c;
for (int i = 0; i < m; i++) {
cin >> b >> c;
bc.at(i) = make_tuple(c, b);
}
sort(bc.begin(), bc.end(), greater<>());
/*for(int i=0; i<m; i++){
cout << get<0>(bc.at(i)) << ' ' << get<1>(bc.at(i)) << endl;
}
cout << endl;*/
int i = 0, j = 0;
while (1) {
if (a.at(i) < get<0>(bc.at(j))) {
a.at(i) = get<0>(bc.at(j));
get<1>(bc.at(j))--;
if (get<1>(bc.at(j)) == 0)
j++;
}
i++;
if (i == n || j == m)
break;
// cout << get<0>(bc.at(0)) << ' ' << get<1>(bc.at(0)) << endl;
// cout << a.at(i) << endl;
}
long long int ans = 0;
for (int i = 0; i < n; i++) {
ans += a.at(i);
// cout << ans << endl;
}
cout << ans << endl;
} | replace | 38 | 39 | 38 | 39 | 0 | |
p03038 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
priority_queue<P> q;
vector<int> a(n), b(m), c(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i] >> c[i];
rep(i, n) q.push(make_pair(a[i], 1));
rep(i, m) q.push(make_pair(c[i], b[i]));
ll 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;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
priority_queue<P> q;
vector<int> a(n), b(m), c(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> b[i] >> c[i];
rep(i, n) q.push(make_pair(a[i], 1));
rep(i, m) q.push(make_pair(c[i], b[i]));
ll 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;
return 0;
} | delete | 0 | 1 | 0 | 0 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
ll ans = 0;
vector<P> d;
rep(i, m) {
int b, c;
cin >> b >> c;
d.push_back(make_pair(c, b));
}
sort(d.rbegin(), d.rend());
int j = 0;
rep(i, n) {
if (d[j].second <= 0)
j++;
if (j >= n)
break;
if (a[i] < d[j].first) {
a[i] = d[j].first;
d[j].second--;
}
// cout << a[i] << "\n";
}
rep(i, n) { ans += a[i]; }
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(all(a));
ll ans = 0;
vector<P> d;
rep(i, m) {
int b, c;
cin >> b >> c;
d.push_back(make_pair(c, b));
}
sort(d.rbegin(), d.rend());
int j = 0;
rep(i, n) {
if (d[j].second <= 0)
j++;
if (j >= m)
break;
if (a[i] < d[j].first) {
a[i] = d[j].first;
d[j].second--;
}
// cout << a[i] << "\n";
}
rep(i, n) { ans += a[i]; }
cout << ans << "\n";
return 0;
}
| replace | 38 | 39 | 38 | 39 | 0 | |
p03038 | C++ | Runtime Error | #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;
}
| replace | 36 | 37 | 36 | 37 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, a, b) for (ll i = a; i < b; i++)
const int max_n = 1e5;
const ll mod = 1e9 + 7;
void send(int a, int b, int c, int d) { printf("%d %d %d %d\n", a, b, c, d); }
int main() {
int n, m;
cin >> n >> m;
vector<ll> v(n);
rep(i, 0, n) { cin >> v[i]; }
vector<ll> ans(n + 1, 0);
rep(i, 0, n) { ans[i + 1] = ans[i] + v[i]; }
sort(all(v));
vector<P> p(m);
rep(i, 0, m) {
ll x, y;
cin >> x >> y;
p.pb(mp(y, x));
}
sort(all(p), greater<P>());
int now = 0;
ll sum = 0;
rep(i, 0, m) {
int st = i;
rep(j, 0, p[i].se) {
if (now >= n)
break;
if (p[i].fi > v[now]) {
v[now] = p[i].fi;
now++;
}
}
}
rep(i, 0, n) { sum += v[i]; }
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, a, b) for (ll i = a; i < b; i++)
const int max_n = 1e5;
const ll mod = 1e9 + 7;
void send(int a, int b, int c, int d) { printf("%d %d %d %d\n", a, b, c, d); }
int main() {
int n, m;
cin >> n >> m;
vector<ll> v(n);
rep(i, 0, n) { cin >> v[i]; }
vector<ll> ans(n + 1, 0);
rep(i, 0, n) { ans[i + 1] = ans[i] + v[i]; }
sort(all(v));
vector<P> p(m);
rep(i, 0, m) {
ll x, y;
cin >> x >> y;
p.pb(mp(y, x));
}
sort(all(p), greater<P>());
int now = 0;
ll sum = 0;
rep(i, 0, m) {
int st = i;
rep(j, 0, p[i].se) {
if (now >= n)
break;
if (p[i].fi > v[now]) {
v[now] = p[i].fi;
now++;
} else {
break;
}
}
}
rep(i, 0, n) { sum += v[i]; }
cout << sum << endl;
return 0;
}
| insert | 38 | 38 | 38 | 40 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A(N);
vector<pair<ll, ll>> CB(M);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < M; i++)
cin >> CB[i].second >> CB[i].first;
sort(A.begin(), A.end());
sort(CB.begin(), CB.end());
reverse(CB.begin(), CB.end());
ll ans = 0;
ll tmp = 0;
for (int i = 0; i < M; i++) {
sort(A.begin(), A.end());
auto itr = upper_bound(A.begin(), A.end(), CB[i].first);
ll cnt = itr - A.begin();
// cout << cnt << " " << CB[i].second << endl;
if (cnt - tmp <= 0)
continue;
cnt = min(cnt - tmp, CB[i].second);
ans += cnt * CB[i].first;
tmp += cnt;
// cout << tmp << endl;
}
for (int i = tmp; i < N; i++)
ans += A[i];
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<ll> A(N);
vector<pair<ll, ll>> CB(M);
for (int i = 0; i < N; i++)
cin >> A[i];
for (int i = 0; i < M; i++)
cin >> CB[i].second >> CB[i].first;
sort(A.begin(), A.end());
sort(CB.begin(), CB.end());
reverse(CB.begin(), CB.end());
ll ans = 0;
ll tmp = 0;
for (int i = 0; i < M; i++) {
auto itr = upper_bound(A.begin(), A.end(), CB[i].first);
ll cnt = itr - A.begin();
// cout << cnt << " " << CB[i].second << endl;
if (cnt - tmp <= 0)
continue;
cnt = min(cnt - tmp, CB[i].second);
ans += cnt * CB[i].first;
tmp += cnt;
// cout << tmp << endl;
}
for (int i = tmp; i < N; i++)
ans += A[i];
cout << ans << endl;
} | delete | 20 | 21 | 20 | 20 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
//
long long num, que;
cin >> num >> que;
map<long long, long long> m;
vector<pair<long long, long long>> p(que);
for (long long i = 0; i < num; i++) {
long long tmp;
cin >> tmp;
m[tmp]++;
}
for (long long i = 0; i < que; i++) {
long long a, b;
cin >> a >> b;
p.at(i) = make_pair(b, a);
}
sort(p.rbegin(), p.rend());
for (long long i = 0; i < que; i++) {
long long cnt = 0;
for (auto itr : m) {
if (itr.second == 0)
continue;
if (p.at(i).second == 0 || itr.first >= p.at(i).first)
continue;
// cout << "itr:" << itr.first << ":" << itr.second << endl;
// cout << "p :" << p.at(i).first << ":" << p.at(i).second;
if (p.at(i).second >= itr.second) {
m[p.at(i).first] += itr.second;
m[itr.first] = 0;
p.at(i).second -= itr.second;
// m.erase(begin(m));
cnt++;
} else {
m[p.at(i).first] += p.at(i).second;
m[itr.first] -= p.at(i).second;
p.at(i).second = 0;
}
// cout << "->" << p.at(i).first << ":" << p.at(i).second << endl;
}
if (cnt > 0)
m.erase(begin(m), next(begin(m), cnt));
}
long long kekka = 0;
for (auto itr : m) {
// cout << (long long)itr.first << "*" << (long long)itr.second << endl;
kekka += (itr.first * itr.second);
}
cout << kekka << endl;
//
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
//
long long num, que;
cin >> num >> que;
map<long long, long long> m;
vector<pair<long long, long long>> p(que);
for (long long i = 0; i < num; i++) {
long long tmp;
cin >> tmp;
m[tmp]++;
}
for (long long i = 0; i < que; i++) {
long long a, b;
cin >> a >> b;
p.at(i) = make_pair(b, a);
}
sort(p.rbegin(), p.rend());
for (long long i = 0; i < que; i++) {
long long cnt = 0;
for (auto itr : m) {
if (itr.second == 0)
continue;
if (p.at(i).second == 0 || itr.first >= p.at(i).first)
break;
// cout << "itr:" << itr.first << ":" << itr.second << endl;
// cout << "p :" << p.at(i).first << ":" << p.at(i).second;
if (p.at(i).second >= itr.second) {
m[p.at(i).first] += itr.second;
m[itr.first] = 0;
p.at(i).second -= itr.second;
// m.erase(begin(m));
cnt++;
} else {
m[p.at(i).first] += p.at(i).second;
m[itr.first] -= p.at(i).second;
p.at(i).second = 0;
}
// cout << "->" << p.at(i).first << ":" << p.at(i).second << endl;
}
if (cnt > 0)
m.erase(begin(m), next(begin(m), cnt));
}
long long kekka = 0;
for (auto itr : m) {
// cout << (long long)itr.first << "*" << (long long)itr.second << endl;
kekka += (itr.first * itr.second);
}
cout << kekka << endl;
//
}
| replace | 29 | 30 | 29 | 30 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N, M;
cin >> N >> M;
vector<int> A(N);
vector<pair<int, int>> BC(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
long long bsum = 0;
for (int i = 0; i < M; i++) {
int b, c;
cin >> b >> c;
bsum += b;
pair<int, int> p = make_pair(c, b);
BC.at(i) = p;
}
sort(BC.begin(), BC.end());
reverse(BC.begin(), BC.end());
int j = min(N, bsum), k = 0;
while (j > 0) {
while (BC.at(k).second > 0) {
A.push_back(BC.at(k).first);
BC.at(k).second--;
j--;
}
k++;
}
long long sum = 0;
sort(A.begin(), A.end(), greater<int>());
for (int i = 0; i < N; i++) {
sum += A.at(i);
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
long long N, M;
cin >> N >> M;
vector<int> A(N);
vector<pair<int, int>> BC(M);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
long long bsum = 0;
for (int i = 0; i < M; i++) {
int b, c;
cin >> b >> c;
bsum += b;
pair<int, int> p = make_pair(c, b);
BC.at(i) = p;
}
sort(BC.begin(), BC.end());
reverse(BC.begin(), BC.end());
int j = min(N, bsum), k = 0;
while (j > 0) {
while (BC.at(k).second > 0) {
A.push_back(BC.at(k).first);
BC.at(k).second--;
j--;
}
k++;
}
long long sum = 0;
sort(A.begin(), A.end(), greater<int>());
for (int i = 0; i < N; i++) {
sum += A.at(i);
}
cout << sum << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p03038 | C++ | Time Limit Exceeded | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
multiset<int> s;
vector<vector<int>> v;
int n, m;
cin >> n >> m;
rep(i, n) {
int a;
cin >> a;
s.insert(a);
}
rep(i, m) {
int b, c;
cin >> b >> c;
v.push_back({c, b});
}
for (auto x : v) {
int i = 0;
for (auto it = s.begin(); it != s.end();) {
if (i == x[1]) {
break;
}
if (x[0] > *it) {
it = s.erase(it);
s.insert(x[0]);
} else {
break;
}
i++;
}
}
long long int t = 0;
for (auto x : s) {
t += (long long int)x;
}
cout << t;
} | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
multiset<int> s;
vector<vector<int>> v;
int n, m;
cin >> n >> m;
rep(i, n) {
int a;
cin >> a;
s.insert(a);
}
rep(i, m) {
int b, c;
cin >> b >> c;
v.push_back({c, b});
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
// for(auto x:v){
// cout << x[0] << x[1] <<endl;
// }
for (auto x : v) {
int i = 0;
for (auto it = s.begin(); it != s.end();) {
if (i == x[1]) {
break;
}
if (x[0] > *it) {
it = s.erase(it);
s.insert(x[0]);
} else {
break;
}
i++;
}
}
long long int t = 0;
for (auto x : s) {
t += (long long int)x;
}
cout << t;
} | insert | 26 | 26 | 26 | 31 | TLE | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map> // pair
#include <vector>
using namespace std;
int main() {
int n, m;
int a[100000];
int b, c, i;
long long int ans = 0;
cin >> n >> m;
vector<pair<int, int>> pairs(m);
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = 0; i < m; i++) {
cin >> b >> c;
pairs[i] = make_pair(c, b);
}
sort(pairs.begin(), pairs.end());
int count = 0;
for (i = m - 1; count < n && i >= 0; i--) {
for (int j = 0; j < pairs[i].second; j++) {
if (a[count] < pairs[i].first) {
a[count] = pairs[i].first;
count++;
} else {
count = n;
}
}
}
for (i = 0; i < n; i++) {
ans += a[i];
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <map> // pair
#include <vector>
using namespace std;
int main() {
int n, m;
int a[100000];
int b, c, i;
long long int ans = 0;
cin >> n >> m;
vector<pair<int, int>> pairs(m);
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (i = 0; i < m; i++) {
cin >> b >> c;
pairs[i] = make_pair(c, b);
}
sort(pairs.begin(), pairs.end());
int count = 0;
for (i = m - 1; count < n && i >= 0; i--) {
for (int j = 0; j < pairs[i].second && count < n; j++) {
if (a[count] < pairs[i].first) {
a[count] = pairs[i].first;
count++;
} else {
count = n;
}
}
}
for (i = 0; i < n; i++) {
ans += a[i];
}
cout << ans << endl;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, M;
scanf("%d%d", &N, &M);
map<ll, int> A;
for (int i = 0; i < N; i++) {
ll a;
scanf("%lld", &a);
A[a]++;
}
vector<int> B(N);
vector<ll> C(N);
for (int i = 0; i < M; i++) {
scanf("%d%lld", &B[i], &C[i]);
}
// for (auto k = A.begin(); k != A.end(); ++k)
// for (int l = 0; l < k->second; l++)
// printf("%lld ", k->first);
// printf("\n");
for (int i = 0; i < M; i++) {
int b = B[i];
while (b > 0) {
auto j = A.begin();
if (j == A.end() || j->first >= C[i])
break;
int p = min(b, j->second);
ll key = j->first;
int q = j->second - p;
A[C[i]] += p;
if (q == 0) {
A.erase(key);
} else {
A[key] = q;
}
b -= p;
}
// for (auto k = A.begin(); k != A.end(); ++k)
// for (int l = 0; l < k->second; l++)
// printf("%lld ", k->first);
// printf("\n");
}
ll ans = 0;
for (auto k = A.begin(); k != A.end(); ++k) {
ans += k->first * k->second;
}
printf("%lld\n", ans);
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int N, M;
scanf("%d%d", &N, &M);
map<ll, int> A;
for (int i = 0; i < N; i++) {
ll a;
scanf("%lld", &a);
A[a]++;
}
vector<int> B(M);
vector<ll> C(M);
for (int i = 0; i < M; i++) {
scanf("%d%lld", &B[i], &C[i]);
}
// for (auto k = A.begin(); k != A.end(); ++k)
// for (int l = 0; l < k->second; l++)
// printf("%lld ", k->first);
// printf("\n");
for (int i = 0; i < M; i++) {
int b = B[i];
while (b > 0) {
auto j = A.begin();
if (j == A.end() || j->first >= C[i])
break;
int p = min(b, j->second);
ll key = j->first;
int q = j->second - p;
A[C[i]] += p;
if (q == 0) {
A.erase(key);
} else {
A[key] = q;
}
b -= p;
}
// for (auto k = A.begin(); k != A.end(); ++k)
// for (int l = 0; l < k->second; l++)
// printf("%lld ", k->first);
// printf("\n");
}
ll ans = 0;
for (auto k = A.begin(); k != A.end(); ++k) {
ans += k->first * k->second;
}
printf("%lld\n", ans);
}
| replace | 23 | 25 | 23 | 25 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
bool f(pair<ll, ll> p1, pair<ll, ll> p2) {
if (p1.second == p2.second)
return p1.first > p2.first;
return p1.second > p2.second;
}
int main() {
ll n, m, i, j;
cin >> n >> m;
ll a[n];
vector<pair<ll, ll>> b(n);
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < m; i++) {
cin >> b[i].first >> b[i].second;
}
sort(a, a + n);
sort(b.begin(), b.end(), f);
for (i = 0, j = 0; i < n && j < m; i++) {
if (a[i] < b[j].second) {
a[i] = b[j].second;
b[j].first--;
if (b[j].first == 0)
j++;
} else
break;
}
ll sum = 0;
for (i = 0; i < n; i++) {
sum += a[i];
}
cout << sum << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long
bool f(pair<ll, ll> p1, pair<ll, ll> p2) {
if (p1.second == p2.second)
return p1.first > p2.first;
return p1.second > p2.second;
}
int main() {
ll n, m, i, j;
cin >> n >> m;
ll a[n];
vector<pair<ll, ll>> b(m);
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < m; i++) {
cin >> b[i].first >> b[i].second;
}
sort(a, a + n);
sort(b.begin(), b.end(), f);
for (i = 0, j = 0; i < n && j < m; i++) {
if (a[i] < b[j].second) {
a[i] = b[j].second;
b[j].first--;
if (b[j].first == 0)
j++;
} else
break;
}
ll sum = 0;
for (i = 0; i < n; i++) {
sum += a[i];
}
cout << sum << endl;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p03038 | Python | Time Limit Exceeded | import bisect
N, M = map(int, input().split())
A = sorted(list(map(int, input().split())))
BC = []
for _ in range(M):
b, c = map(int, input().split())
BC.append((b, c))
BC.sort(reverse=True, key=lambda x: x[1])
ans, i = 0, 0
for bc in BC:
ti = bisect.bisect(A[i:], bc[1]) + i
if (ti > i) and (bc[0] >= (ti - i)):
ans += bc[1] * (ti - i)
i = ti
elif (ti > i) and (bc[0] < (ti - i)):
ans += bc[1] * bc[0]
i = i + bc[0]
print(ans + sum(A[i:]))
| import bisect
N, M = map(int, input().split())
A = sorted(list(map(int, input().split())))
BC = []
for _ in range(M):
b, c = map(int, input().split())
BC.append((b, c))
BC.sort(reverse=True, key=lambda x: x[1])
ans, i = 0, 0
for bc in BC:
ti = bisect.bisect(A, bc[1])
if (ti > i) and (bc[0] >= (ti - i)):
ans += bc[1] * (ti - i)
i = ti
elif (ti > i) and (bc[0] < (ti - i)):
ans += bc[1] * bc[0]
i = i + bc[0]
print(ans + sum(A[i:]))
| replace | 14 | 15 | 14 | 15 | TLE | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <chrono>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using Wbool = std::vector<Vbool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T> using Vec = std::vector<T>;
constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0),
std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';
#define DEBUG(x) std::cerr << #x << " = " << x << '\n';
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define FOReq(i, a, b) for (int(i) = (a); (i) <= (b); ++(i))
#define rFOR(i, a, b) for (int(i) = (b); (i) >= (a); --(i))
#define FORstep(i, a, b, step) for (int(i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n - 1))
#define vREP(ele, vec) for (auto &(ele) : (vec))
#define vREPcopy(ele, vec) for (auto(ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define RSORT(A) std::sort((A).rbegin(), (A).rend())
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) =>
// COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A) \
(A).erase(unique((A).begin(), (A).end()), (A).end())
template <class T> inline int argmin(std::vector<T> vec) {
return min_element(vec.begin(), vec.end()) - vec.begin();
}
template <class T> inline int argmax(std::vector<T> vec) {
return max_element(vec.begin(), vec.end()) - vec.begin();
}
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> inline void reverseSORT(Vec<T> &Array) {
std::sort(Array.begin(), Array.end(), std::greater<T>());
}
inline int BitI(int k) { return 1 << k; }
inline lli BitL(int k) { return 1LL << k; }
inline void putsDouble(double d) { printf("%.16lf\n", d); }
inline int toInt(const string &s) {
int res = 0;
for (char a : s)
res = 10 * res + (a - '0');
return res;
}
inline long long int toLong(const string &s) {
lli res = 0;
for (char a : s)
res = 10 * res + (a - '0');
return res;
}
template <class T> inline std::string toString(T n) {
if (n == 0)
return "0";
std::string res;
if (n < 0) {
n = -n;
while (n != 0) {
res += (char)(n % 10 + '0');
n /= 10;
}
std::reverse(res.begin(), res.end());
return '-' + res;
}
while (n != 0) {
res += (char)(n % 10 + '0');
n /= 10;
}
std::reverse(res.begin(), res.end());
return res;
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
int main(void) {
int n, m;
scanf("%d%d", &n, &m);
Vint A(n);
REP(i, n) scanf("%d", &A[i]);
SORT(A);
Vec<pii> B(m);
REP(i, m) {
int b, c;
scanf("%d%d", &b, &c);
B[i] = make_pair(c, b);
}
reverseSORT(B);
int idx = 0;
bool flag = true;
REP(i, m) {
int c, b;
std::tie(c, b) = B[i];
REP(j, b) {
if (A[idx] < c)
A[idx] = c;
else {
flag = false;
break;
}
idx++;
}
if (not flag)
break;
}
lli sum = 0;
REP(i, n) sum += A[i];
printf("%lld\n", sum);
return 0;
} | #include <algorithm>
#include <chrono>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using Wbool = std::vector<Vbool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T> using Vec = std::vector<T>;
constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0),
std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';
#define DEBUG(x) std::cerr << #x << " = " << x << '\n';
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define FOReq(i, a, b) for (int(i) = (a); (i) <= (b); ++(i))
#define rFOR(i, a, b) for (int(i) = (b); (i) >= (a); --(i))
#define FORstep(i, a, b, step) for (int(i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n - 1))
#define vREP(ele, vec) for (auto &(ele) : (vec))
#define vREPcopy(ele, vec) for (auto(ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define RSORT(A) std::sort((A).rbegin(), (A).rend())
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) =>
// COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A) \
(A).erase(unique((A).begin(), (A).end()), (A).end())
template <class T> inline int argmin(std::vector<T> vec) {
return min_element(vec.begin(), vec.end()) - vec.begin();
}
template <class T> inline int argmax(std::vector<T> vec) {
return max_element(vec.begin(), vec.end()) - vec.begin();
}
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> inline void reverseSORT(Vec<T> &Array) {
std::sort(Array.begin(), Array.end(), std::greater<T>());
}
inline int BitI(int k) { return 1 << k; }
inline lli BitL(int k) { return 1LL << k; }
inline void putsDouble(double d) { printf("%.16lf\n", d); }
inline int toInt(const string &s) {
int res = 0;
for (char a : s)
res = 10 * res + (a - '0');
return res;
}
inline long long int toLong(const string &s) {
lli res = 0;
for (char a : s)
res = 10 * res + (a - '0');
return res;
}
template <class T> inline std::string toString(T n) {
if (n == 0)
return "0";
std::string res;
if (n < 0) {
n = -n;
while (n != 0) {
res += (char)(n % 10 + '0');
n /= 10;
}
std::reverse(res.begin(), res.end());
return '-' + res;
}
while (n != 0) {
res += (char)(n % 10 + '0');
n /= 10;
}
std::reverse(res.begin(), res.end());
return res;
}
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
int main(void) {
int n, m;
scanf("%d%d", &n, &m);
Vint A(n);
REP(i, n) scanf("%d", &A[i]);
SORT(A);
Vec<pii> B(m);
REP(i, m) {
int b, c;
scanf("%d%d", &b, &c);
B[i] = make_pair(c, b);
}
reverseSORT(B);
int idx = 0;
bool flag = true;
REP(i, m) {
int c, b;
std::tie(c, b) = B[i];
REP(j, b) {
if (idx < n and A[idx] < c)
A[idx] = c;
else {
flag = false;
break;
}
idx++;
}
if (not flag)
break;
}
lli sum = 0;
REP(i, n) sum += A[i];
printf("%lld\n", sum);
return 0;
} | replace | 121 | 122 | 121 | 122 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B) {
if (B == 0)
return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
/*------------------------------------------------------------------*/
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
vector<pair<ll, ll>> b(m);
rep(i, m) { cin >> b[i].second >> b[i].first; }
sort(b.begin(), b.end());
/*rep(i, m){
cout << b[i].first << " " << b[i].second << endl;
}*/
vector<ll> a_sum(n + 1);
a_sum[0] = 0;
_rep(i, 1, n + 1) { a_sum[i] = a_sum[i - 1] + a[i - 1]; }
ll num = 0;
ll c_num = 0;
ll ans = a_sum[n];
while (true) {
if (a[num] < b[m - 1].first) {
ans += b[m - 1].first - a[num];
}
c_num++;
num++;
if (c_num == b[m - 1].second) {
m--, c_num = 0;
}
if (num == n - 1 || (m == 1 && c_num == b[0].second))
break;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
#define print(n) std::cout << n << std::endl
#define _print(n) std::cout << n
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B) {
if (B == 0)
return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
/*------------------------------------------------------------------*/
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
vector<pair<ll, ll>> b(m);
rep(i, m) { cin >> b[i].second >> b[i].first; }
sort(b.begin(), b.end());
/*rep(i, m){
cout << b[i].first << " " << b[i].second << endl;
}*/
vector<ll> a_sum(n + 1);
a_sum[0] = 0;
_rep(i, 1, n + 1) { a_sum[i] = a_sum[i - 1] + a[i - 1]; }
ll num = 0;
ll c_num = 0;
ll ans = a_sum[n];
while (true) {
if (a[num] < b[m - 1].first) {
ans += b[m - 1].first - a[num];
}
c_num++;
num++;
if (c_num == b[m - 1].second) {
m--, c_num = 0;
}
if (num == n || (m == 1 && c_num == b[0].second))
break;
}
cout << ans << endl;
} | replace | 52 | 53 | 52 | 53 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int N, M, A[100001], B[100001], C[100001];
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];
sort(A, A + N);
vector<pair<int, int>> CB(M);
for (int i = 0; i < M; i++)
CB[i] = make_pair(C[i], B[i]);
sort(CB.begin(), CB.end(), greater<pair<int, int>>());
int k = 0;
for (int i = 0; i < M; i++) {
for (int j = 0; j < CB[i].second; j++) {
if (N <= k)
break;
if (A[k] < CB[i].first) {
A[k] = CB[i].first;
k++;
}
}
if (N <= k)
break;
}
int64_t ans = 0;
for (int i = 0; i < N; i++)
ans += A[i];
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int N, M, A[100001], B[100001], C[100001];
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];
sort(A, A + N);
vector<pair<int, int>> CB(M);
for (int i = 0; i < M; i++)
CB[i] = make_pair(C[i], B[i]);
sort(CB.begin(), CB.end(), greater<pair<int, int>>());
int k = 0;
for (int i = 0; i < M; i++) {
for (int j = 0; j < CB[i].second; j++) {
if (N <= k)
break;
if (A[k] < CB[i].first) {
A[k] = CB[i].first;
k++;
} else
break;
}
if (N <= k)
break;
}
int64_t ans = 0;
for (int i = 0; i < N; i++)
ans += A[i];
cout << ans << endl;
} | replace | 27 | 28 | 27 | 29 | TLE | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
pair<ll, ll> p[n];
for (int i = 0; i < m; i++) {
ll b, c;
cin >> b >> c;
p[i] = make_pair(c, b);
}
sort(a, a + n);
sort(p, p + m, greater<pair<ll, ll>>());
ll curr = 0, cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= p[curr].first)
break;
a[i] = p[curr].first;
cnt++;
if (cnt == p[curr].second) {
curr++;
cnt = 0;
if (curr == m) {
break;
}
}
}
ll sum = 0;
for (int i = 0; i < n; i++)
sum += a[i];
cout << sum << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
ll a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
pair<ll, ll> p[m];
for (int i = 0; i < m; i++) {
ll b, c;
cin >> b >> c;
p[i] = make_pair(c, b);
}
sort(a, a + n);
sort(p, p + m, greater<pair<ll, ll>>());
ll curr = 0, cnt = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= p[curr].first)
break;
a[i] = p[curr].first;
cnt++;
if (cnt == p[curr].second) {
curr++;
cnt = 0;
if (curr == m) {
break;
}
}
}
ll sum = 0;
for (int i = 0; i < n; i++)
sum += a[i];
cout << sum << endl;
return 0;
} | replace | 28 | 29 | 28 | 29 | 0 | |
p03038 | C++ | Runtime Error | #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;
} | #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;
} | replace | 83 | 84 | 83 | 84 | 0 | |
p03038 | C++ | Runtime Error | #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;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
long long gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
long long lcm(int x, int y) {
if (y == 0) {
return x;
}
return x * y / gcd(x, y);
}
ll min(ll a, ll b) { return a > b ? b : a; }
ll max(ll a, ll b) { return a > b ? a : b; }
int main() {
cin.sync_with_stdio(false);
int n, m;
cin >> n >> m;
priority_queue<ll, vector<ll>, greater<ll>> q;
map<ll, ll> rep;
vector<pair<ll, ll>> arr(m);
for (int i = 0; i < n; i++) {
ll qq;
cin >> qq;
q.push(qq);
rep[qq]++;
}
for (int i = 0; i < m; i++) {
// ll a,b;
// cin>>a>>b;
cin >> arr[i].second >> arr[i].first;
// arr.push_back({b, a});
}
sort(arr.begin(), arr.end());
for (int i = 0; i < m; i++) {
ll a = arr[i].second;
ll b = arr[i].first;
while (a > 0) {
ll qq = q.top();
// q.pop();
if (qq >= b) {
break;
} else {
ll smanji = min(rep[qq], a);
rep[qq] -= smanji;
rep[b] += smanji;
a -= smanji;
q.push(b);
if (rep[qq] == 0) {
q.pop();
rep.erase(qq);
}
}
}
}
ll res = 0;
for (auto i : rep) {
res += i.first * i.second;
}
cout << res << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#define ll long long
using namespace std;
long long gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
long long lcm(int x, int y) {
if (y == 0) {
return x;
}
return x * y / gcd(x, y);
}
ll min(ll a, ll b) { return a > b ? b : a; }
ll max(ll a, ll b) { return a > b ? a : b; }
int main() {
cin.sync_with_stdio(false);
int n, m;
cin >> n >> m;
priority_queue<ll, vector<ll>, greater<ll>> q;
map<ll, ll> rep;
vector<pair<ll, ll>> arr(m);
for (int i = 0; i < n; i++) {
ll qq;
cin >> qq;
q.push(qq);
rep[qq]++;
}
for (int i = 0; i < m; i++) {
// ll a,b;
// cin>>a>>b;
cin >> arr[i].second >> arr[i].first;
// arr.push_back({b, a});
}
sort(arr.begin(), arr.end());
reverse(arr.begin(), arr.end());
for (int i = 0; i < m; i++) {
ll a = arr[i].second;
ll b = arr[i].first;
while (a > 0) {
ll qq = q.top();
// q.pop();
if (qq >= b) {
break;
} else {
ll smanji = min(rep[qq], a);
rep[qq] -= smanji;
rep[b] += smanji;
a -= smanji;
q.push(b);
if (rep[qq] == 0) {
q.pop();
rep.erase(qq);
}
}
}
}
ll res = 0;
for (auto i : rep) {
res += i.first * i.second;
}
cout << res << endl;
} | insert | 59 | 59 | 59 | 60 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B) {
if (B == 0)
return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
/*------------------------------------------------------------------*/
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<pair<ll, ll>> b(m);
rep(i, m) { cin >> b[i].second >> b[i].first; }
sort(a.begin(), a.end());
sort(b.begin(), b.end(), greater<>());
// rep(i, m) cout << b[i].first << " " << b[i].second << endl;
int i = 0;
rep(j, m) {
rep(k, b[j].second) {
if (i + k >= n)
break;
if (a[i + k] < b[j].first) {
a[i + k] = b[j].first;
}
}
i += b[j].second;
}
ll sum = 0;
rep(i, n) { sum += a[i]; }
cout << sum << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (long long int i = 0; i < n; i++)
#define _rep(i, m, n) for (long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int N = 1000000;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B) {
if (B == 0)
return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B) { return A * B / gcd(A, B); }
/*------------------------------------------------------------------*/
int main() {
ll n, m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<pair<ll, ll>> b(m);
rep(i, m) { cin >> b[i].second >> b[i].first; }
sort(a.begin(), a.end());
sort(b.begin(), b.end(), greater<>());
// rep(i, m) cout << b[i].first << " " << b[i].second << endl;
int i = 0;
rep(j, m) {
if (i >= n)
break;
rep(k, b[j].second) {
if (i + k >= n)
break;
if (a[i + k] < b[j].first) {
a[i + k] = b[j].first;
}
}
i += b[j].second;
}
ll sum = 0;
rep(i, n) { sum += a[i]; }
cout << sum << endl;
} | insert | 34 | 34 | 34 | 36 | 0 | |
p03038 | Python | Time Limit Exceeded | N, M = map(int, input().split())
A = list(map(int, input().split()))
CB = []
for _ in range(M):
b, c = map(int, input().split())
CB.append((c, b))
# ascend
A.sort()
# descend
CB.sort(reverse=True)
# fill convert ary
conv = []
for cb in CB:
c, b = cb
conv.extend([c] * b)
cl = len(conv)
sum = 0
for i in range(N):
if i >= cl:
sum += A[i]
else:
sum += max(A[i], conv[i])
print(sum)
| N, M = map(int, input().split())
A = list(map(int, input().split()))
CB = []
for _ in range(M):
b, c = map(int, input().split())
CB.append((c, b))
# ascend
A.sort()
# descend
CB.sort(reverse=True)
# fill convert ary
conv = []
for cb in CB:
c, b = cb
conv.extend([c] * b)
if len(conv) >= N:
break
cl = len(conv)
sum = 0
for i in range(N):
if i >= cl:
sum += A[i]
else:
sum += max(A[i], conv[i])
print(sum)
| insert | 18 | 18 | 18 | 20 | TLE | |
p03038 | Python | Runtime Error | from heapq import heapify, heappop, heappush
from sys import stdin
N, M = map(int, input().split())
A = list(map(int, stdin.readline().split()))
heapify(A)
BC = [None] * M
for i in range(M):
BC[i] = tuple(map(int, stdin.readline().split()))
BC = sorted(BC, key=lambda x: x[1], reversed=True)
print(BC)
enough = False
for bc in BC:
if enough:
break
for i in range(bc[0]):
if bc[1] <= A[0]:
enough = True
break
heappop(A)
heappush(A, bc[1])
print(sum(A))
| from heapq import heapify, heappop, heappush
from sys import stdin
N, M = map(int, input().split())
A = list(map(int, stdin.readline().split()))
heapify(A)
BC = [None] * M
for i in range(M):
BC[i] = tuple(map(int, stdin.readline().split()))
BC = sorted(BC, key=lambda x: x[1], reverse=True)
enough = False
for bc in BC:
if enough:
break
for i in range(bc[0]):
if bc[1] <= A[0]:
enough = True
break
heappop(A)
heappush(A, bc[1])
print(sum(A))
| replace | 9 | 12 | 9 | 10 | TypeError: 'reversed' is an invalid keyword argument for sort() | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03038/Python/s447667839.py", line 10, in <module>
BC = sorted(BC, key=lambda x: x[1], reversed=True)
TypeError: 'reversed' is an invalid keyword argument for sort()
|
p03038 | Python | Runtime Error | N, M = map(int, input().split())
A = sorted(list(map(int, input().split())))
BC = [None] * M
for i in range(M):
BC[i] = tuple(map(int, input().split()))
BC.sort(key=lambda tpl: tpl[1], reverse=True) # sort by C descendant
D = [0] * N
i = 0
j = 0
while i < N and j < M:
b, c = BC[j]
for k in range(i, i + b):
D[k] = c
i += b
j += 1
for i in range(N):
A[i] = max(A[i], D[i])
print(sum(A))
| N, M = map(int, input().split())
A = sorted(list(map(int, input().split())))
BC = [None] * M
for i in range(M):
BC[i] = tuple(map(int, input().split()))
BC.sort(key=lambda tpl: tpl[1], reverse=True) # sort by C descendant
D = [0] * N
i = 0
j = 0
while i < N and j < M:
b, c = BC[j]
for k in range(i, min(i + b, N)):
D[k] = c
i += b
j += 1
for i in range(N):
A[i] = max(A[i], D[i])
print(sum(A))
| replace | 12 | 13 | 12 | 13 | 0 | |
p03038 | Python | Runtime Error | n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
hand = []
for _ in range(m):
b, c = map(int, input().split())
hand.append((b, c))
hand.sort(key=lambda x: x[1], reverse=True)
i = 0
lena = len(a)
flag = False
for h in hand:
for j in range(h[0]):
if i < lena and a[i] >= h[1]:
flag = True
break
else:
a[i] = h[1]
i += 1
if flag:
break
print(sum(a))
| n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
hand = []
for _ in range(m):
b, c = map(int, input().split())
hand.append((b, c))
hand.sort(key=lambda x: x[1], reverse=True)
i = 0
lena = len(a)
flag = False
for h in hand:
for j in range(h[0]):
if i >= lena:
flag = True
break
if a[i] >= h[1]:
flag = True
break
else:
a[i] = h[1]
i += 1
if flag:
break
print(sum(a))
| replace | 14 | 15 | 14 | 18 | 0 | |
p03038 | Python | Runtime Error | N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
BC = [list(map(int, input().split())) for i in range(M)]
BC = sorted(BC, key=lambda x: -x[1])
i = 0
for B, C in BC:
for _ in range(B):
if A[i] < C:
A[i] = C
i += 1
else:
print(sum(A))
exit()
print(sum(A))
| N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
BC = [list(map(int, input().split())) for i in range(M)]
BC = sorted(BC, key=lambda x: -x[1])
i = 0
for B, C in BC:
for _ in range(B):
if i < N and A[i] < C:
A[i] = C
i += 1
else:
print(sum(A))
exit()
print(sum(A))
| replace | 8 | 9 | 8 | 9 | 0 | |
p03038 | C++ | Runtime Error | #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;
}
| replace | 32 | 33 | 32 | 33 | 0 | |
p03038 | Python | Time Limit Exceeded | import sys
from heapq import heapify, heapreplace
def main():
input = sys.stdin.readline
N, M = map(int, input().split())
As = list(map(int, input().split()))
heapify(As)
BCs = [None] * M
for i in range(M):
BCs[i] = list(map(int, input().split()))
BCs = reversed(sorted(BCs, key=lambda x: x[1]))
for B, C in BCs:
for _ in range(B):
if As[0] < C:
heapreplace(As, C)
print(sum(As))
if __name__ == "__main__":
main()
| import sys
from heapq import heapify, heapreplace
def main():
input = sys.stdin.readline
N, M = map(int, input().split())
As = list(map(int, input().split()))
heapify(As)
BCs = [None] * M
for i in range(M):
BCs[i] = list(map(int, input().split()))
BCs = reversed(sorted(BCs, key=lambda x: x[1]))
for B, C in BCs:
for _ in range(B):
if As[0] >= C:
print(sum(As))
sys.exit()
heapreplace(As, C)
print(sum(As))
if __name__ == "__main__":
main()
| replace | 15 | 17 | 15 | 19 | TLE | |
p03038 | Python | Runtime Error | import heapq
from sys import exit
N, M = map(int, input().split())
A = list(map(int, input().split()))
BC = sorted(
[tuple(map(int, input().split())) for _ in range(M)],
key=lambda x: x[1],
reverse=True,
)
heapq.heapify(A)
ans = sum(A)
for b, c in BC:
for _ in range(b):
a = heapq.heappop(A)
if a < c:
ans += c - a
else:
print(ans)
exit()
print(ans)
| import heapq
from sys import exit
N, M = map(int, input().split())
A = list(map(int, input().split()))
BC = sorted(
[tuple(map(int, input().split())) for _ in range(M)],
key=lambda x: x[1],
reverse=True,
)
heapq.heapify(A)
ans = sum(A)
for b, c in BC:
for _ in range(b):
if len(A) == 0:
print(ans)
exit()
a = heapq.heappop(A)
if a < c:
ans += c - a
else:
print(ans)
exit()
print(ans)
| insert | 15 | 15 | 15 | 18 | 0 | |
p03038 | Python | Time Limit Exceeded | #!/usr/bin/env python3
import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
# bc = sorted(bc, key=lambda x: x[1], reverse=True)
# print(bc)
heapq.heapify(a)
for b, c in bc:
for i in range(b):
num = heapq.heappop(a)
if num < c:
heapq.heappush(a, c)
else:
heapq.heappush(a, num)
break
# print(a)
print(sum(a))
| #!/usr/bin/env python3
import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
bc = sorted(bc, key=lambda x: x[1], reverse=True)
# print(bc)
heapq.heapify(a)
for b, c in bc:
for i in range(b):
num = heapq.heappop(a)
if num < c:
heapq.heappush(a, c)
else:
heapq.heappush(a, num)
break
# print(a)
print(sum(a))
| replace | 7 | 8 | 7 | 8 | TLE | |
p03038 | Python | Runtime Error | n, m = map(int, input().split())
a = list(map(int, input().split()))
bc = [tuple(map(int, input().split())) for _ in range(m)]
a.sort()
bc.sort(reverse=True, key=lambda x: x[1])
last_idx = len(a) - 1
idx = 0
for e in bc:
b, c = e
for i in range(b):
if i + idx > last_idx:
break
if a[i + idx] < c:
a[i + idx] = c
else:
break
else:
idx += b
print(a)
print(idx)
continue
break
print(sum(a))
| n, m = map(int, input().split())
a = list(map(int, input().split()))
bc = [tuple(map(int, input().split())) for _ in range(m)]
a.sort()
bc.sort(reverse=True, key=lambda x: x[1])
last_idx = len(a) - 1
idx = 0
for e in bc:
b, c = e
for i in range(b):
if i + idx > last_idx:
break
if a[i + idx] < c:
a[i + idx] = c
idx += b
print(sum(a))
| replace | 14 | 22 | 14 | 15 | 0 | |
p03038 | Python | Runtime Error | from collections import defaultdict
import sys
input = sys.stdin.readline
N, M = [int(item) for item in input().split()]
A = [int(item) for item in input().split()]
A.sort()
new_dict = defaultdict(lambda: 0)
for i in range(M):
b, c = [int(item) for item in input().split()]
new_dict[c] += b
new_dict = sorted(new_dict.items(), key=lambda x: -x[0])
new_list = []
if len(new_dict) > 0:
for k, v in new_dict:
new_list += [k] * v
if len(new_list) >= N:
break
new_list = new_list[:N]
#####
n = min(N, len(new_list))
for i in range(n):
if A[i] >= new_list[i]:
break
A[i] = new_list[i]
print(sum(A))
| from collections import defaultdict
import sys
input = sys.stdin.readline
N, M = [int(item) for item in input().split()]
A = [int(item) for item in input().split()]
A.sort()
new_dict = defaultdict(lambda: 0)
for i in range(M):
b, c = [int(item) for item in input().split()]
new_dict[c] += b
new_dict = sorted(new_dict.items(), key=lambda x: -x[0])
new_list = []
for k, v in new_dict:
if v > N:
v = N
new_list += [k] * v
if len(new_list) >= N:
break
new_list = new_list[:N]
#####
n = min(N, len(new_list))
for i in range(n):
if A[i] >= new_list[i]:
break
A[i] = new_list[i]
print(sum(A))
| replace | 16 | 21 | 16 | 22 | 0 | |
p03038 | Python | Runtime Error | N, M = map(int, input().split())
As = list(map(int, input().split()))
BCs = [tuple(map(int, input().split())) for _ in range(M)]
As.sort()
BCs.sort(key=lambda x: x[1], reverse=True)
iA = 0
for B, C in BCs:
for j in range(B):
if As[iA] < C:
As[iA] = C
iA += 1
else:
break
else:
continue
break
print(sum(As))
| N, M = map(int, input().split())
As = list(map(int, input().split()))
BCs = [tuple(map(int, input().split())) for _ in range(M)]
As.sort()
BCs.sort(key=lambda x: x[1], reverse=True)
iA = 0
for B, C in BCs:
for j in range(B):
if As[iA] < C:
As[iA] = C
iA += 1
if iA >= N:
break
else:
break
else:
continue
break
print(sum(As))
| insert | 13 | 13 | 13 | 15 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#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, n) priority_queue<int> a(n)
#define PQmin(a, n) \
priority_queue<int, std::vector<int>, std::greater<int>> a(n)
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m;
cin >> n >> m;
priority_queue<int, std::vector<int>, std::greater<int>> a;
vector<pair<int, int>> pairs(m);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.push(x);
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
pairs[i] = make_pair(b, a);
}
sort(pairs.rbegin(), pairs.rend());
ll ans = 0;
bool flag = true;
for (int i = 0; i < m; i++) {
for (int j = 0; j < pairs.at(i).second; j++) {
if (a.top() < pairs.at(i).first) {
a.pop();
ans += pairs.at(i).first;
}
if (a.size() == 0) {
flag = false;
break;
}
}
if (flag == false) {
break;
}
}
while (a.size() > 0) {
ans += a.top();
a.pop();
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s) for (int i = 0; i < s; ++i)
#define all(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#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, n) priority_queue<int> a(n)
#define PQmin(a, n) \
priority_queue<int, std::vector<int>, std::greater<int>> a(n)
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int n, m;
cin >> n >> m;
priority_queue<int, std::vector<int>, std::greater<int>> a;
vector<pair<int, int>> pairs(m);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.push(x);
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
pairs[i] = make_pair(b, a);
}
sort(pairs.rbegin(), pairs.rend());
ll ans = 0;
bool flag = true;
for (int i = 0; i < m; i++) {
for (int j = 0; j < pairs.at(i).second; j++) {
if (a.top() < pairs.at(i).first) {
a.pop();
ans += pairs.at(i).first;
} else {
break;
}
if (a.size() == 0) {
flag = false;
break;
}
}
if (flag == false) {
break;
}
}
while (a.size() > 0) {
ans += a.top();
a.pop();
}
cout << ans << endl;
return 0;
}
| insert | 50 | 50 | 50 | 52 | TLE | |
p03038 | Python | Runtime Error | n, m = map(int, input().split())
A = list(map(int, input().split()))
CB = []
for _ in range(m):
b, c = map(int, input().split())
CB.append([c, b])
CB.sort(reverse=True)
A.sort()
index = 0
for i in range(m):
if index >= n:
break
elif A[index] >= CB[i][0]:
break
for j in range(CB[i][1]):
if A[index] >= CB[i][0]:
break
A[index] = CB[i][0]
index += 1
print(sum(A))
| n, m = map(int, input().split())
A = list(map(int, input().split()))
CB = []
for _ in range(m):
b, c = map(int, input().split())
CB.append([c, b])
CB.sort(reverse=True)
A.sort()
index = 0
for i in range(m):
if index >= n:
break
elif A[index] >= CB[i][0]:
break
for j in range(CB[i][1]):
if index >= n:
break
elif A[index] >= CB[i][0]:
break
A[index] = CB[i][0]
index += 1
print(sum(A))
| replace | 18 | 19 | 18 | 21 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cstring>
#include <queue>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define ll long long int
#define getI(a) scanf("%d", &a)
#define getII(a, b) scanf("%d%d", &a, &b)
#define getIII(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define getL(a) scanf("%lld", &a)
#define getLL(a, b) scanf("%lld%lld", &a, &b)
#define getLLL(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define BEND(c) (c).begin(), (c).end()
#define BEND2(c) (c).rbegin(), (c).rend()
#define fi first
#define se second
#define pi 3.1415926535897932384626
#define getS(a) scanf("%s", a)
#define pfi(a) printf("%d", a);
#define pfii(a, b) printf("%d%d", a, b);
#define pfl(a) printf("%lld", a);
#define pfll(a, b) printf("%lld%lld", a, b);
#define pfd(a) printf("%lf", a);
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define sag (sol | 1)
#define sol (root << 1)
#define ort (bas + son) / 2
#define SIZE 1000000007
#define MAXN 100005
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> graph;
int main() {
IOS ll n, m;
cin >> n >> m;
priority_queue<int, vector<int>, greater<int>> qq;
for (int a, i = 0; i < n; ++i) {
cin >> a;
qq.push(a);
}
vpi vec2;
for (int a, b, j = 0; j < m; ++j) {
cin >> a >> b;
vec2.pb({b, a});
}
sort(BEND(vec2));
for (int l = vec2.size() - 1; l >= 0; --l) {
int t = 10;
while (t > 0) {
if (vec2[l].first < qq.top())
break;
t = vec2[l].second;
qq.pop();
qq.push(vec2[l].first);
if (vec2[l].second == 0) {
break;
}
vec2[l].second--;
t--;
}
if (vec2[l].first < qq.top())
break;
}
ll sum = 0;
for (int k = 0; k < n; ++k) {
// cout << qq.top() <<" ";
sum += qq.top();
qq.pop();
}
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
#include <cstring>
#include <queue>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define ll long long int
#define getI(a) scanf("%d", &a)
#define getII(a, b) scanf("%d%d", &a, &b)
#define getIII(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define getL(a) scanf("%lld", &a)
#define getLL(a, b) scanf("%lld%lld", &a, &b)
#define getLLL(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define BEND(c) (c).begin(), (c).end()
#define BEND2(c) (c).rbegin(), (c).rend()
#define fi first
#define se second
#define pi 3.1415926535897932384626
#define getS(a) scanf("%s", a)
#define pfi(a) printf("%d", a);
#define pfii(a, b) printf("%d%d", a, b);
#define pfl(a) printf("%lld", a);
#define pfll(a, b) printf("%lld%lld", a, b);
#define pfd(a) printf("%lf", a);
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define sag (sol | 1)
#define sol (root << 1)
#define ort (bas + son) / 2
#define SIZE 1000000007
#define MAXN 100005
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> graph;
int main() {
IOS ll n, m;
cin >> n >> m;
priority_queue<int, vector<int>, greater<int>> qq;
for (int a, i = 0; i < n; ++i) {
cin >> a;
qq.push(a);
}
vpi vec2;
for (int a, b, j = 0; j < m; ++j) {
cin >> a >> b;
vec2.pb({b, a});
}
sort(BEND(vec2));
for (int l = vec2.size() - 1; l >= 0; --l) {
int t = 10;
while (t > 0) {
if (vec2[l].first <= qq.top())
break;
t = vec2[l].second;
qq.pop();
qq.push(vec2[l].first);
if (vec2[l].second == 0) {
break;
}
vec2[l].second--;
t--;
}
if (vec2[l].first < qq.top())
break;
}
ll sum = 0;
for (int k = 0; k < n; ++k) {
// cout << qq.top() <<" ";
sum += qq.top();
qq.pop();
}
cout << sum;
return 0;
}
| replace | 71 | 72 | 71 | 72 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.push_back(x);
}
vector<pair<int, int>> op(m);
for (int i = 0; i < m; i++) {
cin >> op[i].first >> op[i].second;
}
sort(op.begin(), op.end(),
[&](auto x, auto y) { return x.second > y.second; });
sort(a.rbegin(), a.rend());
long long sum = 0;
for (int i = 0; i < m; i++) {
while (op[i].first--) {
if (a.back() < op[i].second) {
sum += 1LL * op[i].second;
a.pop_back();
} else
break;
}
}
for (int x : a)
sum += 1LL * x;
cout << sum << '\n';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.push_back(x);
}
vector<pair<int, int>> op(m);
for (int i = 0; i < m; i++) {
cin >> op[i].first >> op[i].second;
}
sort(op.begin(), op.end(),
[&](auto x, auto y) { return x.second > y.second; });
sort(a.rbegin(), a.rend());
long long sum = 0;
for (int i = 0; i < m; i++) {
while (op[i].first--) {
if (!a.empty() and a.back() < op[i].second) {
sum += 1LL * op[i].second;
a.pop_back();
} else
break;
}
}
for (int x : a)
sum += 1LL * x;
cout << sum << '\n';
} | replace | 24 | 25 | 24 | 25 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int n, m, i, j;
ll answer;
int tmpa, tmpb, tmpc;
vector<int> d;
int endmark;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> ope(n);
bool end = false;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
for (i = 0; i < m; i++)
cin >> ope[i].second >> ope[i].first;
sort(ope.begin(), ope.end());
endmark = 0;
for (i = ope.size() - 1; i >= 0; i--) {
int c = ope[i].first;
int b = ope[i].second;
for (j = 0; j < b; j++) {
d.push_back(c);
endmark++;
if (endmark == n) {
end = true;
break;
}
}
if (end)
break;
}
for (i = 0; i < n; i++) {
if (a[i] >= d[i])
break;
else
a[i] = d[i];
}
answer = 0;
for (i = 0; i < a.size(); i++)
answer += a[i];
cout << answer << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int n, m, i, j;
ll answer;
int tmpa, tmpb, tmpc;
vector<int> d;
int endmark;
cin >> n >> m;
vector<int> a(n);
vector<pair<int, int>> ope(m);
bool end = false;
for (i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
for (i = 0; i < m; i++)
cin >> ope[i].second >> ope[i].first;
sort(ope.begin(), ope.end());
endmark = 0;
for (i = ope.size() - 1; i >= 0; i--) {
int c = ope[i].first;
int b = ope[i].second;
for (j = 0; j < b; j++) {
d.push_back(c);
endmark++;
if (endmark == n) {
end = true;
break;
}
}
if (end)
break;
}
for (i = 0; i < n; i++) {
if (a[i] >= d[i])
break;
else
a[i] = d[i];
}
answer = 0;
for (i = 0; i < a.size(); i++)
answer += a[i];
cout << answer << endl;
return 0;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
/************************************************/
#define rep(i, n) for (int i = 0; i < n; i++)
#define m_p make_pair
#define pb push_back
#define fr first
#define se second
#define forn(i, a, n) for (int i = a; i < n; i++)
#define foreach(i, c) \
for (__typeof(c.begin()) i = (c.begin()); i != (c).end(); i++)
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define sz(s) s.size()
#define all(s) s.begin(), s.end()
#define zero(x) memset(x, 0, sizeof(x))
#define vii vector<pair<int, int>>
#define mpis map<int, string>
#define mpii map<int, int>
#define mpsi map<string, int>
#define re return
#define mod 1000000007
/************************************************/
using namespace std;
long long get() {
char c = getchar();
long long x = 0LL;
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9') {
x *= 10LL;
x += (c - '0');
c = getchar();
}
return x;
}
int n, m;
ll ans = 0;
ll a[100001];
pii p[100001];
int main() {
ios::sync_with_stdio(0);
cin >> n >> m;
rep(i, n) cin >> a[i];
rep(i, m) cin >> p[i].se >> p[i].fr;
sort(p, p + m);
reverse(p, p + m);
sort(a, a + n);
int now = 0;
rep(i, n) rep(i, m) {
while (now < n && p[i].se && p[i].fr > a[now]) {
a[now] = p[i].fr;
now++;
p[i].se--;
}
if (now == n || p[i].se)
break;
}
rep(i, n) ans += a[i];
cout << ans;
re 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
/************************************************/
#define rep(i, n) for (int i = 0; i < n; i++)
#define m_p make_pair
#define pb push_back
#define fr first
#define se second
#define forn(i, a, n) for (int i = a; i < n; i++)
#define foreach(i, c) \
for (__typeof(c.begin()) i = (c.begin()); i != (c).end(); i++)
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define sz(s) s.size()
#define all(s) s.begin(), s.end()
#define zero(x) memset(x, 0, sizeof(x))
#define vii vector<pair<int, int>>
#define mpis map<int, string>
#define mpii map<int, int>
#define mpsi map<string, int>
#define re return
#define mod 1000000007
/************************************************/
using namespace std;
long long get() {
char c = getchar();
long long x = 0LL;
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9') {
x *= 10LL;
x += (c - '0');
c = getchar();
}
return x;
}
int n, m;
ll ans = 0;
ll a[100001];
pii p[100001];
int main() {
ios::sync_with_stdio(0);
cin >> n >> m;
rep(i, n) cin >> a[i];
rep(i, m) cin >> p[i].se >> p[i].fr;
sort(p, p + m);
reverse(p, p + m);
sort(a, a + n);
int now = 0;
rep(i, m) {
while (now < n && p[i].se && p[i].fr > a[now]) {
a[now] = p[i].fr;
now++;
p[i].se--;
}
if (now == n || p[i].se)
break;
}
rep(i, n) ans += a[i];
cout << ans;
re 0;
}
| replace | 67 | 68 | 67 | 68 | TLE | |
p03038 | C++ | Runtime Error | // Created by martinezdiego on 27/5/19
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int a[n];
pair<int, int> bc[m];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
cin >> bc[i].first >> bc[i].second;
}
sort(bc, bc + m,
[](pair<int, int> a, pair<int, int> b) { return a.second > b.second; });
bool finished = false;
for (int i = 0, p = 0; i < m and !finished; i++) {
while (bc[i].first and !finished) {
if (a[p] < bc[i].second)
a[p] = bc[i].second;
else
finished = true;
p++;
bc[i].first--;
}
}
long long ans = 0;
for (int i = 0; i < n; i++) {
ans += a[i];
}
cout << ans << '\n';
return 0;
} | // Created by martinezdiego on 27/5/19
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
int a[n];
pair<int, int> bc[m];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
for (int i = 0; i < m; i++) {
cin >> bc[i].first >> bc[i].second;
}
sort(bc, bc + m,
[](pair<int, int> a, pair<int, int> b) { return a.second > b.second; });
bool finished = false;
for (int i = 0, p = 0; i < m and p < n and !finished; i++) {
while (bc[i].first and p < n and !finished) {
if (a[p] < bc[i].second)
a[p] = bc[i].second;
else
finished = true;
p++;
bc[i].first--;
}
}
long long ans = 0;
for (int i = 0; i < n; i++) {
ans += a[i];
}
cout << ans << '\n';
return 0;
} | replace | 22 | 24 | 22 | 24 | 0 | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, M;
double dd, cc;
ll A[101010];
ll i, j, k, l;
vector<pll> cbv;
ll ans;
int main() {
scanf("%lld%lld", &N, &M);
fornum(i, 0, N) { scanf("%lld", &A[i]); }
sort(A, A + N);
fornum(i, 0, M) {
ll b, c;
scanf("%lld%lld", &b, &c);
cbv.push_back({c, b});
}
sort(cbv.begin(), cbv.end(), greater<pll>());
j = 0;
fornum(i, 0, M) {
ll b = cbv[i].second;
ll c = cbv[i].first;
while (b > 0 && A[j] < c) {
A[j++] = c;
b--;
}
}
fornum(i, 0, N) { ans += A[i]; }
printf("%lld", ans);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, M;
double dd, cc;
ll A[101010];
ll i, j, k, l;
vector<pll> cbv;
ll ans;
int main() {
scanf("%lld%lld", &N, &M);
fornum(i, 0, N) { scanf("%lld", &A[i]); }
sort(A, A + N);
fornum(i, 0, M) {
ll b, c;
scanf("%lld%lld", &b, &c);
cbv.push_back({c, b});
}
sort(cbv.begin(), cbv.end(), greater<pll>());
j = 0;
fornum(i, 0, M) {
ll b = cbv[i].second;
ll c = cbv[i].first;
while (b > 0 && j < N && A[j] < c) {
A[j++] = c;
b--;
}
}
fornum(i, 0, N) { ans += A[i]; }
printf("%lld", ans);
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p03038 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
int main() {
int N, M;
scanf("%d %d", &N, &M);
long long int b, c;
vector<long long int> A(N);
vector<pair<long long int, long long int>> BC;
int i, j = 0, k;
for (i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
for (j = 0; j < M; j++) {
scanf("%lld %lld", &b, &c);
BC.push_back(make_pair(c, b));
}
sort(A.begin(), A.end());
sort(BC.begin(), BC.end(), greater<pair<long long int, long long int>>());
int f = 0;
int pi = 0;
j = 0;
while (j < M && f == 0) {
k = BC[j].second - 1 + pi;
while (A[k] > BC[j].first) {
if (k != 0)
k--;
else {
f = 1;
break;
}
}
if (f == 1)
break;
for (int l = pi; l <= k; l++) {
A[l] = BC[j].first;
}
pi = k + 1;
j++;
}
long long int res = 0;
for (i = 0; i < N; i++) {
res += A[i];
}
printf("%lld", res);
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
int main() {
int N, M;
scanf("%d %d", &N, &M);
long long int b, c;
vector<long long int> A(N);
vector<pair<long long int, long long int>> BC;
int i, j = 0, k;
for (i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
for (j = 0; j < M; j++) {
scanf("%lld %lld", &b, &c);
BC.push_back(make_pair(c, b));
}
sort(A.begin(), A.end());
sort(BC.begin(), BC.end(), greater<pair<long long int, long long int>>());
int f = 0;
int pi = 0;
j = 0;
while (j < M && f == 0) {
k = BC[j].second - 1 + pi;
if (k > N)
k = N - 1;
while (A[k] > BC[j].first) {
if (k != 0)
k--;
else {
f = 1;
break;
}
}
if (f == 1)
break;
for (int l = pi; l <= k; l++) {
A[l] = BC[j].first;
}
pi = k + 1;
j++;
}
long long int res = 0;
for (i = 0; i < N; i++) {
res += A[i];
}
printf("%lld", res);
return 0;
} | insert | 31 | 31 | 31 | 33 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
// #define DEBUG true
#define DEBUG false
using namespace std;
const int MAX = 100001;
const int MOD = 1000000007;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
int ceil(int x, int y) { return (x % y == 0) ? x / y : x / y + 1; }
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[m], c[m];
for (int i = 0; i < m; i++)
cin >> b[i] >> c[i];
vector<pii> cb(m);
for (int i = 0; i < m; i++) {
cb[i] = make_pair(c[i], b[i]);
}
sort(cb.begin(), cb.end());
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < n; i++) {
pq.push(a[i]);
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < cb[i].second && pq.top() < cb[i].first; j++) {
pq.pop();
pq.push(cb[i].first);
}
}
ll sum = 0;
while (!pq.empty()) {
sum += pq.top();
pq.pop();
}
cout << sum << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
// #define DEBUG true
#define DEBUG false
using namespace std;
const int MAX = 100001;
const int MOD = 1000000007;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
int ceil(int x, int y) { return (x % y == 0) ? x / y : x / y + 1; }
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int b[m], c[m];
for (int i = 0; i < m; i++)
cin >> b[i] >> c[i];
vector<pii> cb(m);
for (int i = 0; i < m; i++) {
cb[i] = make_pair(c[i], b[i]);
}
sort(cb.begin(), cb.end());
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < n; i++) {
pq.push(a[i]);
}
for (int i = m - 1; i >= 0; i--) {
for (int j = 0; j < cb[i].second && pq.top() < cb[i].first; j++) {
pq.pop();
pq.push(cb[i].first);
}
}
ll sum = 0;
while (!pq.empty()) {
sum += pq.top();
pq.pop();
}
cout << sum << endl;
return 0;
}
| replace | 55 | 56 | 55 | 56 | TLE | |
p03038 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long
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(N);
for (int i = 0; i < M; i++)
cin >> CB[i].second >> CB[i].first;
sort(CB.begin(), CB.end(), greater<pair<int, int>>());
int t = 0, i = 0;
while (t <= N && i < M) {
for (int _ = 0; _ < CB[i].second; _++)
A.push_back(CB[i].first);
t += CB[i].second;
i++;
}
sort(A.begin(), A.end(), greater<int>());
int ans = 0;
for (int i = 0; i < N; i++)
ans += A[i];
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
#define int long
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);
for (int i = 0; i < M; i++)
cin >> CB[i].second >> CB[i].first;
sort(CB.begin(), CB.end(), greater<pair<int, int>>());
int t = 0, i = 0;
while (t <= N && i < M) {
for (int _ = 0; _ < CB[i].second; _++)
A.push_back(CB[i].first);
t += CB[i].second;
i++;
}
sort(A.begin(), A.end(), greater<int>());
int ans = 0;
for (int i = 0; i < N; i++)
ans += A[i];
cout << ans;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p03038 | C++ | Runtime Error | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
bool cmp(pint a, pint b) { return a.second > b.second; }
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;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n, m;
cin >> n >> m;
vector<ll> a(n);
vector<pint> p(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> p[i].first >> p[i].second;
ll sum = 0;
rep(i, m) sum += p[i].first;
ll tmp = 0;
sort(ALL(p), cmp);
ll i = 0;
while (tmp <= min(sum, n)) {
rep(j, p[i].first) {
a.push_back(p[i].second);
tmp++;
if (tmp > min(sum, n))
break;
}
i++;
}
sort(ALL(a), greater<ll>());
ll ans = 0;
rep(i, n) { ans += a[i]; }
cout << ans << endl;
} | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
bool cmp(pint a, pint b) { return a.second > b.second; }
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;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n, m;
cin >> n >> m;
vector<ll> a(n);
vector<pint> p(m);
rep(i, n) cin >> a[i];
rep(i, m) cin >> p[i].first >> p[i].second;
ll sum = 0;
rep(i, m) sum += p[i].first;
ll tmp = 0;
sort(ALL(p), cmp);
ll i = 0;
while (tmp <= min(sum, n)) {
if (m <= i)
break;
rep(j, p[i].first) {
a.push_back(p[i].second);
tmp++;
if (tmp > min(sum, n))
break;
}
i++;
}
sort(ALL(a), greater<ll>());
ll ans = 0;
rep(i, n) { ans += a[i]; }
cout << ans << endl;
} | insert | 133 | 133 | 133 | 135 | 0 | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, M;
cin >> N >> M;
vector<int> a(N);
rep(i, N) cin >> a[i];
map<int, int, greater<int>> mp;
rep(i, M) {
int b, c;
cin >> b >> c;
mp[c] += b;
}
priority_queue<int> p_que;
for (auto p : mp) {
while (p.second != 0) {
p_que.push(p.first);
p.second--;
}
}
sort(a.begin(), a.end());
ll ans = 0;
rep(i, N) {
if (a[i] < p_que.top() && !p_que.empty()) {
ans += p_que.top();
p_que.pop();
} else {
ans += a[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int N, M;
cin >> N >> M;
vector<int> a(N);
rep(i, N) cin >> a[i];
map<int, int, greater<int>> mp;
rep(i, M) {
int b, c;
cin >> b >> c;
mp[c] += b;
}
priority_queue<int> p_que;
for (auto p : mp) {
while (p.second != 0 && p_que.size() < N) {
p_que.push(p.first);
p.second--;
}
}
sort(a.begin(), a.end());
ll ans = 0;
rep(i, N) {
if (a[i] < p_que.top() && !p_que.empty()) {
ans += p_que.top();
p_que.pop();
} else {
ans += a[i];
}
}
cout << ans << endl;
return 0;
} | replace | 19 | 20 | 19 | 20 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#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 <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long int
const int INF = 1001001001001001LL;
int di[] = {-1, 0, 1, 0, -1, 1, 1, -1};
int dj[] = {0, 1, 0, -1, 1, 1, -1, -1};
// えびちゃんの make_vector (ここから)
template <typename Tp, size_t N>
std::vector<Tp>
make_vector_detail(std::vector<size_t> &sizes,
typename std::enable_if<(N == 1), const Tp &>::type x) {
return std::vector<Tp>(sizes[0], x);
}
template <typename Tp, size_t N>
auto make_vector_detail(std::vector<size_t> &sizes,
typename std::enable_if<(N > 1), const Tp &>::type x) {
size_t size = sizes[N - 1];
sizes.pop_back();
return std::vector<decltype(make_vector_detail<Tp, N - 1>(sizes, x))>(
size, make_vector_detail<Tp, N - 1>(sizes, x));
}
template <typename Tp, size_t N>
auto make_vector(const size_t (&sizes)[N], const Tp &x) {
std::vector<size_t> s(N);
for (size_t i = 0; i < N; ++i)
s[i] = sizes[N - i - 1];
return make_vector_detail<Tp, N>(s, x);
}
// えびちゃんの make_vector (ここまで)
signed 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());
vector<pair<int, int>> p(m);
for (int i = 0; i < m; i++) {
int b, c;
cin >> b >> c;
p[i].first = c;
p[i].second = b;
}
sort(p.rbegin(), p.rend());
for (int i = 0; i < m; i++)
cerr << p[i].first << " " << p[i].second << endl;
int idx = 0;
for (int i = 0; i < m; i++) {
if (idx == n)
break;
int c = p[i].first;
int b = p[i].second;
for (int j = 0; j < b; j++) {
if (idx == n)
break;
if (a[idx] < c) {
a[idx] = c;
idx++;
}
}
}
for (int i = 0; i < n; i++)
cerr << a[i] << " ";
cerr << endl;
int ans = 0;
for (int i = 0; i < n; i++)
ans += a[i];
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#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 <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long int
const int INF = 1001001001001001LL;
int di[] = {-1, 0, 1, 0, -1, 1, 1, -1};
int dj[] = {0, 1, 0, -1, 1, 1, -1, -1};
// えびちゃんの make_vector (ここから)
template <typename Tp, size_t N>
std::vector<Tp>
make_vector_detail(std::vector<size_t> &sizes,
typename std::enable_if<(N == 1), const Tp &>::type x) {
return std::vector<Tp>(sizes[0], x);
}
template <typename Tp, size_t N>
auto make_vector_detail(std::vector<size_t> &sizes,
typename std::enable_if<(N > 1), const Tp &>::type x) {
size_t size = sizes[N - 1];
sizes.pop_back();
return std::vector<decltype(make_vector_detail<Tp, N - 1>(sizes, x))>(
size, make_vector_detail<Tp, N - 1>(sizes, x));
}
template <typename Tp, size_t N>
auto make_vector(const size_t (&sizes)[N], const Tp &x) {
std::vector<size_t> s(N);
for (size_t i = 0; i < N; ++i)
s[i] = sizes[N - i - 1];
return make_vector_detail<Tp, N>(s, x);
}
// えびちゃんの make_vector (ここまで)
signed 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());
vector<pair<int, int>> p(m);
for (int i = 0; i < m; i++) {
int b, c;
cin >> b >> c;
p[i].first = c;
p[i].second = b;
}
sort(p.rbegin(), p.rend());
for (int i = 0; i < m; i++)
cerr << p[i].first << " " << p[i].second << endl;
int idx = 0;
for (int i = 0; i < m; i++) {
if (idx == n)
break;
int c = p[i].first;
int b = p[i].second;
for (int j = 0; j < b; j++) {
if (idx == n)
break;
if (a[idx] < c) {
a[idx] = c;
idx++;
} else {
idx = n;
break;
}
}
}
for (int i = 0; i < n; i++)
cerr << a[i] << " ";
cerr << endl;
int ans = 0;
for (int i = 0; i < n; i++)
ans += a[i];
cout << ans << endl;
return 0;
}
| insert | 94 | 94 | 94 | 98 | TLE | |
p03038 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for (ll i = st; i < ed; i++)
#define repn(i, st, ed) for (ll i = st; i <= ed; i++)
#define repb(i, ed, st) for (ll i = ed; i >= st; i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef unsigned long long int llt;
typedef long double ld;
const long double PI = 3.141592653589793238463;
const int N = 1e5 + 10;
const ll INF = 1LL << 60;
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;
}
// Main Code
int main() {
int n, m;
cin >> n >> m;
priority_queue<ll, vector<ll>, greater<ll>> pq;
rep(i, 0, n) {
ll x;
cin >> x;
pq.push(x);
}
vector<pair<ll, ll>> vp;
rep(i, 0, m) {
ll x, y;
cin >> x >> y;
vp.pb({y, x});
}
sort(all(vp), greater<pair<ll, ll>>());
ll ans = 0;
rep(i, 0, m) {
if (pq.top() > vp[i].f || pq.empty())
break;
ll num = vp[i].f, cnt = vp[i].s;
while (cnt-- && pq.top() <= num) {
ans += num;
pq.pop();
}
}
while (!pq.empty()) {
ans += pq.top();
pq.pop();
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for (ll i = st; i < ed; i++)
#define repn(i, st, ed) for (ll i = st; i <= ed; i++)
#define repb(i, ed, st) for (ll i = ed; i >= st; i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef unsigned long long int llt;
typedef long double ld;
const long double PI = 3.141592653589793238463;
const int N = 1e5 + 10;
const ll INF = 1LL << 60;
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;
}
// Main Code
int main() {
int n, m;
cin >> n >> m;
priority_queue<ll, vector<ll>, greater<ll>> pq;
rep(i, 0, n) {
ll x;
cin >> x;
pq.push(x);
}
vector<pair<ll, ll>> vp;
rep(i, 0, m) {
ll x, y;
cin >> x >> y;
vp.pb({y, x});
}
sort(all(vp), greater<pair<ll, ll>>());
ll ans = 0;
rep(i, 0, m) {
if (pq.top() > vp[i].f || pq.empty())
break;
ll num = vp[i].f, cnt = vp[i].s;
while (cnt-- && pq.top() < num && !pq.empty()) {
ans += num;
pq.pop();
}
}
while (!pq.empty()) {
ans += pq.top();
pq.pop();
}
cout << ans << endl;
}
| replace | 53 | 54 | 53 | 54 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.