oj.uz

Submission #62036

# Submission time Handle Problem Language Result Execution time Memory
62036 2018-07-27T09:28:12 Z Mahmoud_Adel Fortune Telling 2 (JOI14_fortune_telling2) C++11
0 / 100
 4 ms 248 KB 
#include <iostream>
#include <climits>

using namespace std;

typedef long long ll;

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

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -