Climbing the Leaderboard

这是hackrank上的一道medium题目

题意

原文在：https://www.hackerrank.com/challenges/climbing-the-leaderboard/problem?h_r=internal-search

代码

#include<bits/stdc++.h>

using namespace std;

int main(){
    int m,n,i,j,res = 0;
    cin >> m;
    int scores[m];
    for(i = 0; i < m; i++){
        cin >> scores[i];
        if(i > 0 && scores[i] == scores[i-1]){
            m--;
            i--;
        }
    }
    int length = i;
    //cout << "res: " << res << endl;
    cin >> n;
    int alice[n];
    int tmp = length;
    for(i = 0; i < n; i++)
        cin >> alice[i];
    res = length-1;
    for(i = 0; i < n; i++){
        for(j = res; j >= 0; j--){
            if(scores[j] > alice[i]){
                break;
            }
        }
        cout << j+2 << endl;
        //cout << "j: " << j << endl;
        res = j;
    }
    /*
    for(i = 0; i < length; i++){
        cout << scores[i] << " ";
    }
    cout << "\n" << length << endl;
    */
}