Submission #707975

#TimeUsernameProblemLanguageResultExecution timeMemory
707975TAhmed33Unija (COCI17_unija)C++98
0 / 100
713 ms65536 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
int arr[10000001] = {};
signed main () {
	int n;
	cin >> n;
	while (n--) {
		int x, y;
		cin >> x >> y;
		x /= 2;
		arr[x] = max(arr[x], y);
	}
	int ans = arr[10000000];
	for (int i = 9999999; i >= 1; i--) {
		arr[i] = max(arr[i], arr[i + 1]);
		ans += arr[i];
	}
	ans *= 2;
	cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...