12345678910111213141516171819 |
- #include<iostream>
- #include<algorithm>
- using namespace std;
- int main() {
- int a[10], k;
- for (int i = 0; i < 10; i++) {
- cin >> a[i];
- }
- cin >> k;
- if (!binary_search(a, a + 10, k)) {
- cout << "Not exist!";
- } else {
- int idx = lower_bound(a, a + 10, k) - a;
- cout << idx << endl;
- }
- return 0;
- }
|