oj.uz

답안 #872655

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872655 2023-11-13T13:45:55 Z vjudge1 Sure Bet (CEOI17_sure) C++11
20 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;


void print(ll a) {
	if(a < 10) cout << "0.000" << a;
	else if(a < 100) cout << "0.00" << a;
	else if(a < 1000) cout << "0.0" << a;
	else if(a < 10000) cout << "0." << a;
	else cout << a/10000 << "." << a%10000;
	return; 
	
}

int main() {
	cout.precision(12);
	int n;
	cin >> n;

	vector<ll> v1(n), v2(n);
	for(int i = 0; i<n; i++) {
		float a, b;
		cin >> a >> b;

		a *= 10000;
		b *= 10000;


		v1[i] = (ll) round(a);
		v2[i] = (ll) round(b);
	}

	sort(v1.begin(), v1.end()); sort(v2.begin(), v2.end());
	reverse(v1.begin(), v1.end()); reverse(v2.begin(), v2.end());

	ll ptr1 = 0, ptr2 = 0;
	ll val1 = 0, val2 = 0, rem = 0;
	ll ans = 0;

	/*
	for(int i : v1) cout << i << " ";
	cout << "\n";
	for(int i : v2) cout << i << " ";
	cout << "\n";
	*/
	while(ptr1 <= n && ptr2 <= n) {
		if(val1 < val2) {
			val1 += v1[ptr1];
			ptr1++;
			rem += 10000;
		}

		else{
			val2+= v2[ptr2];
			ptr2++;
			rem += 10000;
		}

		ans = max(ans, min(val1, val2) - rem);

	}
	print(ans);


}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -