Submission #62039

#TimeUsernameProblemLanguageResultExecution timeMemory
62039Mahmoud_AdelFortune Telling 2 (JOI14_fortune_telling2)C++14
4 / 100
3045 ms1004 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{
	int n, k;
	cin >> n >> k;
	ll a[n], b[n];
	for(int i=0; i<n; i++)
	cin >> a[i] >> b[i];
	while(k--)
	{
		ll x;
		cin >> x;
		for(int i=0; i<n; i++)
		if(a[i] <= x)
		swap(a[i], b[i]);
	}
	ll sum = 0;
	for(int i=0; i<n; i++)
	sum += a[i];
	cout << sum << endl;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...