Submission #506205

#	Time	Username	Problem	Language	Result	Execution time	Memory
506205		colossal_pepe	Fortune Telling 2 (JOI14_fortune_telling2)	C++17	4 / 100	3076 ms	1860 KiB

fortune_telling2

#include <iostream>
#include <vector>
using namespace std;

int n, k;
vector<int> a, b, t;

int main() {
	cin >> n >> k;
	a.resize(n), b.resize(n);
	t.resize(k);
	for (int i = 0; i < n; i++) {
		cin >> a[i] >> b[i];
	}
	for (int i = 0; i < k; i++) {
		cin >> t[i];
	}
	long long ans = 0;
	for (int i = 0; i < n; i++) {
		int upside = 0;
		for (int j = 0; j < k; j++) {
			int x;
			if (upside % 2 == 0) x = a[i];
			else x = b[i];
			if (x <= t[j]) upside++;
		}
		if (upside % 2 == 0) ans += a[i];
		else ans += b[i];
	}
	cout << ans << endl;
	return 0;
}

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