| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 109333 | 付明澄 | 折半查找法 | C++ | Wrong Answer | 80 | 1 MS | 292 KB | 206 | 2023-11-08 13:31:46 |
#include<bits/stdc++.h> using namespace std; int main() { int n,a[100001],m,i; cin>>n; for(i=1;i<=n;i++)cin>>a[i]; cin>>m; cout<<(lower_bound(a+1,a+n+1,m)-a>n?-1:lower_bound(a+1,a+n+1,m)-a); }