# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1060872 | onbert | 커다란 상품 (IOI17_prize) | C++17 | 0 ms | 0 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 "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int n) {
int l = 0, r = n-1;
while (l<r) {
int mid = (l+r)/2;
vector<int> val = ask(mid);
if (val[0] + val[1]==n-1) return mid;
if (val[0] < i) r = mid-1;
else l = mid+1;
}
return l;
}