Submission #431232

#	Time	Username	Problem	Language	Result	Execution time	Memory
431232		faresbasbs	Fortune Telling 2 (JOI14_fortune_telling2)	C++14	4 / 100	3059 ms	460 KiB

fortune_telling2

#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
int n,k,a[40001],b[40001];

int main(){
	cin >> n >> k;
	for(int i = 1 ; i <= n ; i += 1){
		cin >> a[i] >> b[i];
	}
	for(int i = 1 ; i <= k ; i += 1){
		int f;
		cin >> f;
		for(int j = 1 ; j <= n ; j += 1){
			if(a[j] <= f){
				swap(a[j],b[j]);
			}
		}
	}
	long long ans = 0;
	for(int i = 1 ; i <= n ; i += 1){
		ans += a[i];
	}
	cout << ans << endl;
}

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