Submission #73164996

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int main(){
  int n, l, r;
  cin >> n >> l >> r;
  vector<int> a(n);
  for (int i=0; i<n; i++){
    cin >> a[i];
  }
  vector<int> b;
  for (int i=0; i<n; i++){
    if (l<=a[i] && r>=a[i]){
      b.push_back(a[i]);
    }
  }
  sort(b.begin(), b.end());
  for (int i=0; i<n; i++){
    if (a[i]==b[b.size()-1]){
      cout << i+1 << endl;
      return 0;
    }else if(b.size()==0){
      cout << -1 << endl;
      return 0;
    }
  }
}

Submission Info

Judge Result