# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
252214 | ekrem | Stove (JOI18_stove) | C++98 | 0 ms | 256 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 999999999;
int main() {
int N, M;
scanf("%d%d", &N, &M);
vector<int> a(++N, 0);
for (int i = 1; i < N; i++) scanf("%d", &a[i]);
vector<int> b(1, INF);
for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) b.push_back(-(a[i]+a[j]));
sort(b.begin(), b.end());
int ans = 0;
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
ans = max(ans, a[i]+a[j] + -*lower_bound(b.begin(), b.end(), -(M - (a[i]+a[j]))));
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |