답안 #866566

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
866566	2023-10-26T12:11:45 Z	12345678	Sure Bet (CEOI17_sure)	C++17	60 / 100	2000 ms	3148 KB

sure

#include <bits/stdc++.h>

using namespace std;

int n;
double ans;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    vector<double> a(n), b(n);
    for (int i=0; i<n; i++) cin>>a[i]>>b[i];
    sort(a.begin(), a.end());
    reverse(a.begin(), a.end());
    sort(b.begin(), b.end());
    reverse(b.begin(), b.end());
    for (int i=1; i<n; i++) a[i]+=a[i-1], b[i]+=b[i-1];
    for (int i=0; i<n; i++) for (int j=0; j<n; j++) ans=max(ans, min(a[i], b[j])-i-j-2);
    printf("%.4lf", ans);
}

Subtask #1

20.0 / 20.0

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

Subtask #2

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	596 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	456 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	3 ms	348 KB	Output is correct
14	Correct	2 ms	348 KB	Output is correct
15	Correct	2 ms	468 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct

Subtask #3

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	596 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	456 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	3 ms	348 KB	Output is correct
14	Correct	2 ms	348 KB	Output is correct
15	Correct	2 ms	468 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Execution timed out	2029 ms	3148 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-