Submission #754316

#TimeUsernameProblemLanguageResultExecution timeMemory
754316jmyszka2007Fortune Telling 2 (JOI14_fortune_telling2)C++17
4 / 100
3045 ms1760 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...