This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define st first
#define nd second
constexpr int LIM = 2e5;
constexpr int SQRT = 633;
pair<int, int>tab[LIM + 10];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++) {
cin >> tab[i].st >> tab[i].nd;
}
for(int i = 1; i <= k; i++) {
int x;
cin >> x;
for(int j = 1; j <= n; j++) {
if(tab[j].st <= x) {
swap(tab[j].st, tab[j].nd);
}
}
}
ll ans = 0;
for(int i = 1; i <= n; i++) {
ans += tab[i].st;
}
cout << ans << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |