Submission #77649

#	Time	Username	Problem	Language	Result	Execution time	Memory
77649		emil_physmath	Fortune Telling 2 (JOI14_fortune_telling2)	C++14	4 / 100	3023 ms	3636 KiB

fortune_telling2

#include <iostream>
using namespace std;
const int MAXN=200005, MAXK=200005;

int n, k;
long long a[MAXN], b[MAXN], t[MAXK], sum;

int main()
{
	cin>>n>>k;
	for (int i=0; i<n; i++)
		cin>>a[i]>>b[i];
	for (int j=0; j<k; j++)
		cin>>t[j];
	for (int j=0; j<k; j++)
		for (int i=0; i<n; i++)
			if (a[i]<=t[j])
				swap(a[i], b[i]);
	for (int i=0; i<n; i++)
		sum+=a[i];
	cout<<sum<<endl;

	char I;
	cin >> I;
	return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 31
• Subtask 3: 0 / 65