답안 #843000

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
843000	2023-09-03T14:29:03 Z	vjudge1	Sure Bet (CEOI17_sure)	C++17	60 / 100	2000 ms	4688 KB

sure

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 17;
double ans, a[N], b[N], fa[N], fb[N];
int n;
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
    sort (a + 1, a + n + 1);
    sort (b + 1, b + n + 1);
    for (int i = n; i >= 1; i--)
    {
        fa[n - i + 1] = fa[n - i] + a[i];
        fb[n - i + 1] = fb[n - i] + b[i];
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            ans = max (ans, min (fa[i], fb[j]) - i - j);
    printf("%.4lf",(double) ans);
}

Subtask #1

20.0 / 20.0

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

Subtask #2

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2488 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	3 ms	2392 KB	Output is correct
13	Correct	3 ms	2392 KB	Output is correct
14	Correct	3 ms	2396 KB	Output is correct
15	Correct	3 ms	2392 KB	Output is correct
16	Correct	3 ms	2392 KB	Output is correct

Subtask #3

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2488 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	3 ms	2392 KB	Output is correct
13	Correct	3 ms	2392 KB	Output is correct
14	Correct	3 ms	2396 KB	Output is correct
15	Correct	3 ms	2392 KB	Output is correct
16	Correct	3 ms	2392 KB	Output is correct
17	Execution timed out	2045 ms	4688 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-