Top contestants | Hackerearth Problem solution

    Top contestants | Hackerearth Problem solution:-

 You are given that 

$N$ candidates participated in a contest. For each candidate, you are given $A_i$, representing the points scored by the $i^{th}$ candidate in the contest. You have to print the indexes of the top $K$ candidates of the contest.

Note: $A_i\ne A_j\mathrm{\forall }i\ne j$ i.e, all $A_i$ are distinct.

Input format

• First line: Two space-separated integers $N$ and $K$
• Next line: $N$ space-separated integers. The $i^{th}$integer denotes the points scored by the $i^{th}$candidate in the contest.

Output format

• Print $K$ space-separated integers, denoting the indexes of the top $K$ candidates.

Constraints

$1\le N\le {10}^5$

$1\le K\le N$

$1\le A_i\le {10}^9$

Sample Input

5 3
25 5 17 10 45

Sample Output

5 1 3

Time Limit: 1

Memory Limit: 256

Source Limit:

Explanation

The points scored by candidates are $25,5,17,10,45$. The points scored by top $3$ candidates of the contest are $45,25,17$. Indexes of those points are $5,1,3$ respectively.You are given that 

$N$ candidates participated in a contest. For each candidate, you are given $A_i$, representing the points scored by the $i^{th}$ candidate in the contest. You have to print the indexes of the top $K$ candidates of the contest.

Note: $A_i\ne A_j\mathrm{\forall }i\ne j$ i.e, all $A_i$are distinct.

Input format

• First line: Two space-separated integers $N$ and $K$
• Next line: $N$ space-separated integers. The $i^{th}$integer denotes the points scored by the $i^{th}$candidate in the contest.

Output format

• Print $K$ space-separated integers, denoting the indexes of the top $K$ candidates.

Constraints

$1\le N\le {10}^5$

$1\le K\le N$

$1\le A_i\le {10}^9$

Sample Input

5 3
25 5 17 10 45

Sample Output

5 1 3

Time Limit: 1

Memory Limit: 256

Source Limit:

Explanation

The points scored by candidates are $25,5,17,10,45$. The points scored by top $3$ candidates of the contest are $45,25,17$. Indexes of those points are $5,1,3$ respectively.You are given that 

$N$ candidates participated in a contest. For each candidate, you are given $A_i$, representing the points scored by the $i^{th}$ candidate in the contest. You have to print the indexes of the top $K$ candidates of the contest.

Note: $A_i\ne A_j\mathrm{\forall }i\ne j$ i.e, all $A_i$are distinct.

Input format

• First line: Two space-separated integers $N$ and $K$
• Next line: $N$ space-separated integers. The $i^{th}$integer denotes the points scored by the $i^{th}$candidate in the contest.

Output format

• Print $K$ space-separated integers, denoting the indexes of the top $K$ candidates.

Constraints

$1\le N\le {10}^5$

$1\le K\le N$

$1\le A_i\le {10}^9$

Sample Input

5 3
25 5 17 10 45

Sample Output

5 1 3

Time Limit: 1

Memory Limit: 256

Source Limit:

Explanation

The points scored by candidates are $25,5,17,10,45$. The points scored by top $3$ candidates of the contest are $45,25,17$. Indexes of those points are $5,1,3$ respectively.You are given that 

$N$ candidates participated in a contest. For each candidate, you are given $A_i$, representing the points scored by the $i^{th}$ candidate in the contest. You have to print the indexes of the top $K$ candidates of the contest.

Note: $A_i\ne A_j\mathrm{\forall }i\ne j$ i.e, all $A_i$are distinct.

Input format

• First line: Two space-separated integers $N$ and $K$
• Next line: $N$ space-separated integers. The $i^{th}$integer denotes the points scored by the $i^{th}$candidate in the contest.

Output format

• Print $K$ space-separated integers, denoting the indexes of the top $K$ candidates.

Constraints

$1\le N\le {10}^5$

$1\le K\le N$

$1\le A_i\le {10}^9$

Sample Input

5 3
25 5 17 10 45

Sample Output

5 1 3

Time Limit: 1

Memory Limit: 256

Source Limit:

Explanation

The points scored by candidates are $25,5,17,10,45$. The points scored by top $3$ candidates of the contest are $45,25,17$. Indexes of those points are $5,1,3$ respectively.You are given that 

$N$ candidates participated in a contest. For each candidate, you are given $A_i$, representing the points scored by the $i^{th}$ candidate in the contest. You have to print the indexes of the top $K$ candidates of the contest.

Note: $A_i\ne A_j\mathrm{\forall }i\ne j$ i.e, all $A_i$are distinct.

Input format

• First line: Two space-separated integers $N$ and $K$
• Next line: $N$ space-separated integers. The $i^{th}$integer denotes the points scored by the $i^{th}$candidate in the contest.

Output format

• Print $K$ space-separated integers, denoting the indexes of the top $K$ candidates.

Constraints

$1\le N\le {10}^5$

$1\le K\le N$

$1\le A_i\le {10}^9$

Sample Input

5 3
25 5 17 10 45

Sample Output

5 1 3

Time Limit: 1

Memory Limit: 256

Source Limit:

Explanation

The points scored by candidates are $25,5,17,10,45$. The points scored by top $3$ candidates of the contest are $45,25,17$. Indexes of those points are $5,1,3$ respectively.You are given that 

$N$ candidates participated in a contest. For each candidate, you are given $A_i$, representing the points scored by the $i^{th}$ candidate in the contest. You have to print the indexes of the top $K$ candidates of the contest.

Note: $A_i\ne A_j\mathrm{\forall }i\ne j$ i.e, all $A_i$are distinct.

Input format

• First line: Two space-separated integers $N$ and $K$
• Next line: $N$ space-separated integers. The $i^{th}$integer denotes the points scored by the $i^{th}$candidate in the contest.

Output format

• Print $K$ space-separated integers, denoting the indexes of the top $K$ candidates.

Constraints

$1\le N\le {10}^5$

$1\le K\le N$

$1\le A_i\le {10}^9$

Sample Input

5 3
25 5 17 10 45

Sample Output

5 1 3

Time Limit: 1

Memory Limit: 256

Source Limit:

Explanation

The points scored by candidates are $25,5,17,10,45$. The points scored by top $3$ candidates of the contest are $45,25,17$. Indexes of those points are $5,1,3$ respectively.You are given that 

$N$ candidates participated in a contest. For each candidate, you are given $A_i$, representing the points scored by the $i^{th}$ candidate in the contest. You have to print the indexes of the top $K$ candidates of the contest.

Note: $A_i\ne A_j\mathrm{\forall }i\ne j$ i.e, all $A_i$are distinct.

Input format

• First line: Two space-separated integers $N$ and $K$
• Next line: $N$ space-separated integers. The $i^{th}$integer denotes the points scored by the $i^{th}$candidate in the contest.

Output format

• Print $K$ space-separated integers, denoting the indexes of the top $K$ candidates.

Constraints

$1\le N\le {10}^5$

$1\le K\le N$

$1\le A_i\le {10}^9$

Sample Input

5 3
25 5 17 10 45

Sample Output

5 1 3

Time Limit: 1

Memory Limit: 256

Source Limit:

Explanation

The points scored by candidates are $25,5,17,10,45$. The points scored by top $3$ candidates of the contest are $45,25,17$. Indexes of those points are $5,1,3$ respectively.You are given that 

$N$ candidates participated in a contest. For each candidate, you are given $A_i$, representing the points scored by the $i^{th}$ candidate in the contest. You have to print the indexes of the top $K$ candidates of the contest.

Note: $A_i\ne A_j\mathrm{\forall }i\ne j$ i.e, all $A_i$are distinct.

Input format

• First line: Two space-separated integers $N$ and $K$
• Next line: $N$ space-separated integers. The $i^{th}$integer denotes the points scored by the $i^{th}$candidate in the contest.

Output format

• Print $K$ space-separated integers, denoting the indexes of the top $K$ candidates.

Constraints

$1\le N\le {10}^5$

$1\le K\le N$

$1\le A_i\le {10}^9$

Sample Input

5 3
25 5 17 10 45

Sample Output

5 1 3

Time Limit: 1

Memory Limit: 256

Source Limit:

Explanation

The points scored by candidates are $25,5,17,10,45$. The points scored by top $3$ candidates of the contest are $45,25,17$. Indexes of those points are $5,1,3$ respectively.You are given that 

$N$ candidates participated in a contest. For each candidate, you are given $A_i$, representing the points scored by the $i^{th}$ candidate in the contest. You have to print the indexes of the top $K$ candidates of the contest.

Note: $A_i\ne A_j\mathrm{\forall }i\ne j$ i.e, all $A_i$are distinct.

Input format

• First line: Two space-separated integers $N$ and $K$
• Next line: $N$ space-separated integers. The $i^{th}$integer denotes the points scored by the $i^{th}$candidate in the contest.

Output format

• Print $K$ space-separated integers, denoting the indexes of the top $K$ candidates.

Constraints

$1\le N\le {10}^5$

$1\le K\le N$

$1\le A_i\le {10}^9$

Sample Input

5 3
25 5 17 10 45

Sample Output

5 1 3

Time Limit: 1

Memory Limit: 256

Source Limit:

Explanation

The points scored by candidates are $25,5,17,10,45$. The points scored by top $3$ candidates of the contest are $45,25,17$. Indexes of those points are $5,1,3$ respectively.

$10$

Top contestants | Hackerearth Problem solutionCode:-

  Here I am going to give you two solution first one is on the basis of C language and second one is on the basis of c++ language which you can submit in c++14 and c++17 also

Solution 1 ( C language):-

#include <stdio.h>

#include <stdlib.h>

#include <ctype.h>

#define pcx putchar_unlocked

#define gcx getchar_unlocked

typedef long int lint;

static inline lint getli () {

lint n =0;

int c = gcx();

while(c<'0' || c>'9') c = gcx();

while(c>='0' && c<='9') {

n = n * 10 + c-'0';

c = gcx();

} return n;

}

static inline void putli (lint n, char lc) {

if (!n) {

pcx('0'); if(lc) pcx(lc); return;

}

char s[24]; lint rdi =0;

while (n) {

s[rdi++] = '0' + n % 10;

n /= 10;

}

while (rdi) pcx(s[--rdi]);

if(lc) pcx(lc);

}

typedef struct {

int points;

int index;

} pi_t;

int cmp(const void *p, const void *q) { // DSC order

return (((pi_t*)p)->points < ((pi_t*)q)->points);

}

int main () {

lint N = getli();

lint K = getli();

pi_t *PI = malloc ((N +1) * sizeof(pi_t));

PI[0].points = 0;

PI[0].index = 0;

for (lint ai=1; ai<=N; ) {

PI[ai].index = ai;

PI[ai++].points = getli();

}

qsort (PI, N+1, sizeof(pi_t), cmp);

for (lint ai=0; ai<K; )

putli (PI[ai++].index, ' ');

return 0;

}

Solution 2 ( C++ language):-

 This solution is based on the c++ language and you can submit ib c++14 and c++17 also.
In this solution first three lines of the main function is only for the decreasing the time of execution of the program..

ios_base::sync_with_stdio(false);

cin.tie(NULL);

cout.tie(NULL);

This is your choice that you want to use this or not but in some cases the code may take more time in execution and that time we need it .

#include <bits/stdc++.h>

using namespace std;

void init(){

cin.tie(0);

cin.sync_with_stdio(0);

}

int main()

{

init();

int n, k;

cin>> n >> k;

pair<int, int> a[n];

for(int i = 0; i < n; i++) {

     cin>> a[i].first;

     a[i].second = i + 1;

}

sort(a, a + n );

for(int i = n-1; i >= n - k; i--)

cout<< a[i].second << " ";

return 0;

}

Keywords:- 

  ,top contestants hackerearth solution python,
,capital of hills hackerearth solutions,
,the number line problem hackerearth solution,
,minimum money hackerearth solution,
,bank transaction hackerearth solution,
,an equilateral triangle hackerearth solution,
,hackerearth python solutions,
,capitals and cities hackerearth solution,

Recommended Post:

Companies interview:-

• Swap adjacent characters 
• Double the vowel characters
  
• Check valid parenthesis
  
• Print the characters with their frequencies
  
• Find closest value
  
• Word Count
•  Program of CaesarCipher
• Program to find the perfect city
• Annual Day | Tech Mahindra coding question
• Find the number of pairs in the array whose sum is equal to a given target.

Full C course:-    

• C -Tutorial
  

Key points:-

• How to set limit in the floating value in python
  
• What is boolean data type
• How to print any character without using format specifier
• How to check that given number is power of 2 or not
  
• How to fix limit in double and floating numbers after dot (.) in c++
  
• How to print a double or floating point number in scientific notation and fixed notation
  
• How to take input a string in c
  
• How to reduce the execution time of program in c++.
  

Cracking the coding interview:-

 Array and string:-

• Is Unique
  
• Check Permutation
  
• Urlify
  
• One away
  
• String Compression
  
• Zero matrix
  

Tree and graph:-

• Route between nodes
  
• Minimal Tree
  
• List of Depth
  
• Validate BST
  
• Successor
  

Hackerearth Problems:-

• Very Cool numbers | Hacker earth solution
• Vowel Recognition | Hackerearth practice problem solution
  
• Birthday party | Hacker earth solution
• Most frequent | hacker earth problem solution
• program to find symetric difference of two sets
•  cost of balloons | Hacker earth problem solution
• Chacha o chacha | hacker earth problem solution
• jadu and dna | hacker earth solution
• Bricks game | hacker earth problem
• Anti-Palindrome strings | hacker earth solution
• connected components in the graph | hacker earth data structure
• odd one out || hacker earth problem solution
• Minimum addition | Hackerearth Practice problem
  
• The magical mountain | Hackerearth Practice problem
  
• The first overtake | Hackerearth Practice problem
  

Hackerrank Problems:-

•  Playing With Characters | Hackerrank practice problem solution
• Sum and Difference of Two Numbers | hackerrank practice problem solution
  
• Functions in C | hackerrank practice problem solution
  
• Pointers in C | hackerrank practice problem solution
  
• Conditional Statements in C | Hackerrank practice problem solution
  
• For Loop in C | hackerrank practice problem solution
  
• Sum of Digits of a Five Digit Number | hackerrank practice problem solution
  
• 1D Arrays in C | hackerrank practice problem solution
  
• Array Reversal | hackerrank practice problem solution
  
• Printing Tokens | hackerrank practice problem solution
  
• Digit Frequency | hackerrank practice problem solution
  
• Calculate the Nth term | hackerrank practice problem solution

Data structure:-

•   Program to find cycle in the graph
• Implementation of singly link list
• Implementation of queue by using link list
• Algorithm of quick sort
• stack by using link list
• program to find preorder post order and inorder of the binary search tree
• Minimum weight of spanning tree
  
• Preorder, inorder and post order traversal of the tree

Must check this:-

• PPS lab all the problems of 1st year 
• C- program of CPU scheduling Algorithms

 MCQs:-

• Engineering mathematics -4 MCQs
• CSS (Computer cyber security ) MCQS
•