Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- main(){
- int n,k;
- cin>>n>>k;
- map<int,int> m;
- vector<int> a;
- vector<pair<int,int>> all;
- for(int i=0;i<n;i++){
- int b;
- cin>>b;
- m[b]+=1;
- all.push_back({b,i+1});
- if(m[b]==1)
- a.push_back(b);
- }
- sort(a.begin(),a.end());
- sort(all.begin(),all.end());
- if(a.size()<k){
- cout<<-1;
- return 0;
- }
- int cnt=0;
- int true_cnt=0;
- int i=a.size()-1;
- while(cnt!=k){
- true_cnt+=m[a[i]];
- cnt+=1;
- i-=1;
- }
- vector<int> ans;
- for(int i=n-true_cnt;i>=1;i--){
- ans.push_back(all[i-1].second);
- }
- for(int i=n;i>n-true_cnt;i--){
- ans.push_back(all[i-1].second);
- }
- reverse(ans.begin(),ans.end());
- for(auto i:ans)
- cout<<i<<' ';
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement