oj.uz

답안 #865321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
865321 2023-10-24T07:24:06 Z vjudge1 Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 348 KB 
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <fstream>
#include <unordered_map>
using namespace std;

typedef long long ll;
typedef long double ld;

#define all(x) x.begin(),x.end()
#define pb push_back
#define ent "\n"

const int maxn = (int)3e5 + 13;
const ll inf = (long long)1e18 + 20;
const int mod = (int)1e9 + 7;

int n;
pair<ld,ld>a[maxn];

void solve(){
	cin >> n;
	for(int i = 1 ; i <= n ; i ++){
		cin >> a[i].first >> a[i].second;
	}
	sort(a + 1,a + 1 + n);
	reverse(a + 1,a + 1 + n);
	ld ans = 0,mx = 0;
	for(int i = 1 ; i <= n ; i ++){
		ans += a[i].first;
		ld sum = 0;
		for(int j = i + 1 ; j <= n ; j ++){
			ld kol = j;
			sum += a[j].second;
			//cout << i << ' ' << j << ' ' << sum - kol << ent;
			mx = max(mx,min(sum,ans) - kol);
		}
	}
	cout << mx;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t --){
		solve();
	}
	return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -