Submission #71634290

---

Source Code Expand

#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define COUT(num,len) cout << fixed << setprecision(len) << num;
#define ALL(x) (x).begin(), (x).end()
#define coutY cout << "Yes" << endl;
#define coutN cout << "No" << endl;
#define arrIn(arr, start, N) for (int i = (start); i < (N); ++i) cin >> arr[i];
#define arrOut(arr, start, N) for  (int i = (start); i < (N); ++i) { cout << arr[i] <<" "; } cout << endl;
#define arrCopy(arr1,arr2, start, N) for (int i = (start); i < (N); ++i) arr2[i]= arr1[i];
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }
void YN(bool tf) { cout << (tf ? "YES\n" : "NO\n"); }
string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string abc="abcdefghijklmnopqrstuvwxyz";

//cout << fixed << setprecision(20) <<

int gcd(int a, int b){ //最大公約数
  if(a%b == 0){
    return b;
  }else{
    return gcd(b, a%b);
  }
}

int lcm(int a, int b){ //最小公倍数
  return a*b / gcd(a, b);
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int N,M;
  cin >> N >> M;
  vector<int> data(N);
  vector<int> vote(N,0);
  arrIn(data,0,N);
  for(int i=0;i<M;i++){
    int B;
    cin >> B;
    for(int j=0;j<N;j++){
      if(data[j]<=B){
        vote[j]++;
        break;
      }
    }
  }
  int max=0,sport=1;
  for(int i=0;i<N;i++){
    if(vote[i]>max){
      max=vote[i];
      sport=i+1;
    }
  }
  cout << sport << endl;
  
 
  return 0;
}

Submission Info

Judge Result