/** * Author: Xan * Date: 27th April 2018 * * Challenge: * https://www.hackerrank.com/challenges/climbing-the-leaderboard/problem * * I created the function get_position(), * and added the body to the function, * climbingLeaderboard(). */ #include using namespace std; vector split_string(string); /* * Complete the climbingLeaderboard function below. */ int get_position(vector scores, int alice) { // Add Alice's score to the list. scores.push_back(alice); // Reverse sort the list. sort(scores.rbegin(), scores.rend()); // Remove duplicates. scores.erase ( unique ( scores.begin(), scores.end() ), scores.end() ); // Find the index of Alice's score. ptrdiff_t index = find ( scores.begin(), scores.end(), alice ) - scores.begin(); // If found (which it must be, as we // put it in ourselves esrlier in // this function)... if (index < scores.size()) { // Her position in the leaderboard // is the index plus one. int position = index + 1; return position; } // Failed to get a position. return -1; } vector climbingLeaderboard(vector scores, vector alice) { /* * Write your code here. */ vector return_positions; // For each of Alice's scores, do... for (int i = 0; i < alice.size(); i++) { // Find the leaderboard position of // this score. int position = get_position(scores, alice[i]); return_positions.push_back(position); //cout << position << endl; } // DEBUG: Output all her leaderboard // positions. for (int i = 0; i < return_positions.size(); i++) { cout << return_positions[i] << endl; } // Return Alice's leaderboard positions. return return_positions; } int main() { ofstream fout(getenv("OUTPUT_PATH")); int scores_count; cin >> scores_count; cin.ignore(numeric_limits::max(), '\n'); string scores_temp_temp; getline(cin, scores_temp_temp); vector scores_temp = split_string(scores_temp_temp); vector scores(scores_count); for (int scores_itr = 0; scores_itr < scores_count; scores_itr++) { int scores_item = stoi(scores_temp[scores_itr]); scores[scores_itr] = scores_item; } int alice_count; cin >> alice_count; cin.ignore(numeric_limits::max(), '\n'); string alice_temp_temp; getline(cin, alice_temp_temp); vector alice_temp = split_string(alice_temp_temp); vector alice(alice_count); for (int alice_itr = 0; alice_itr < alice_count; alice_itr++) { int alice_item = stoi(alice_temp[alice_itr]); alice[alice_itr] = alice_item; } vector result = climbingLeaderboard(scores, alice); for (int result_itr = 0; result_itr < result.size(); result_itr++) { fout << result[result_itr]; if (result_itr != result.size() - 1) { fout << "\n"; } } fout << "\n"; fout.close(); return 0; } vector split_string(string input_string) { string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) { return x == y and x == ' '; }); input_string.erase(new_end, input_string.end()); while (input_string[input_string.length() - 1] == ' ') { input_string.pop_back(); } vector splits; char delimiter = ' '; size_t i = 0; size_t pos = input_string.find(delimiter); while (pos != string::npos) { splits.push_back(input_string.substr(i, pos - i)); i = pos + 1; pos = input_string.find(delimiter, i); } splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1)); return splits; }

Leaderboard Challenge