f=open('input.txt','r')
n,k=map(int,f.readline().split())
a=list(map(int,f.readline().split()))
f.close()
t=open('output.txt','w')
b=[]
for i in range(n):
b.append((a[i],i+1))
b.sort()
f1=open('output.txt','w')
f1.write(str(b[n-k][0])+'\n')
ans=''
for i in range(n-k,n):
ans+=str(b[i][1])+' '
f1.write(ans)
f1.close()
#include<bits/stdc++.h>
using namespace std;
typedef long long int lint;
static bool order(pair<int,int>p1,pair<int,int>p2){
return p1.first>p2.first;
}
int main(){
ifstream fin;
fin.open("input.txt");
vector<int>arr;
int a;
while(fin>>a){
arr.push_back(a);
}
int n=arr[0];
int k=arr[1];
vector<pair<int,int>>temp;
for(int i=2;i<arr.size();i++){
temp.push_back({arr[i],i-1});
}
sort(temp.begin(),temp.end(),order);
ofstream fout;
fout.open("output.txt");
if(fout){
fout<<temp[k-1].first<<endl;
for(int i=0;i<k;i++){
fout<<temp[i].second<<" ";
}
fout<<endl;
}
return 0;
}791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |