oj.uz

Submission #370969

# Submission time Handle Problem Language Result Execution time Memory
370969 2021-02-25T09:56:32 Z FatihSolak Unija (COCI17_unija) C++17
100 / 100
 342 ms 28524 KB 
#include <bits/stdc++.h>
#define N 10000005
using namespace std;
int arr[N];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	int n;
	cin >> n;
	for(int i=0;i<n;i++){
		int a,b;
		cin >> a >> b;
		arr[a] = max(arr[a],b);
	}
	long long ans = 0;
	int maxi = 0;
	for(int i=N-1;i>0;i--){
		maxi = max(maxi,arr[i]);
		ans+=maxi;
	}
	cout << ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 364 KB Output is correct
2 Correct 18 ms 364 KB Output is correct
3 Correct 20 ms 492 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 364 KB Output is correct
2 Correct 19 ms 512 KB Output is correct
3 Correct 18 ms 492 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 492 KB Output is correct
2 Correct 21 ms 492 KB Output is correct
3 Correct 19 ms 492 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 492 KB Output is correct
2 Correct 19 ms 492 KB Output is correct
3 Correct 19 ms 492 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 342 ms 28396 KB Output is correct
2 Correct 341 ms 28524 KB Output is correct
3 Correct 335 ms 28396 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 364 KB Output is correct
2 Correct 19 ms 364 KB Output is correct
3 Correct 18 ms 492 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 1132 KB Output is correct
2 Correct 30 ms 1132 KB Output is correct
3 Correct 24 ms 1132 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 3052 KB Output is correct
2 Correct 48 ms 3052 KB Output is correct
3 Correct 40 ms 3180 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 8428 KB Output is correct
2 Correct 95 ms 8428 KB Output is correct
3 Correct 91 ms 8400 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 337 ms 28524 KB Output is correct
2 Correct 339 ms 28416 KB Output is correct
3 Correct 336 ms 28396 KB Output is correct