fork(1) download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long
  4. #define pi (3.141592653589)
  5. #define mod 1000000007
  6. #define int long long
  7. #define float double
  8. #define pb push_back
  9. #define mp make_pair
  10. #define ff first
  11. #define ss second
  12. #define all(c) c.begin(), c.end()
  13. #define min3(a, b, c) min(c, min(a, b))
  14. #define min4(a, b, c, d) min(d, min(c, min(a, b)))
  15. #define rfo(i, n) for(int i=n-1;i>=0;i--)
  16. #define fo(i,n) for(int i=0;i<n;i++)
  17. #define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  18. #define PRINT(arr) for(int i=0;i<sizeof(arr)/sizeof(arr[0]);i++) cout<<arr[i]<<" "; cout<<endl;
  19. #define INPUT(arr,n) int n; cin>>n;int arr[n];for(int i=0;i<n;i++) cin>>arr[i];
  20. #define FO(i,n) for(int i=0;i<n;i++)
  21. #define DISPLAY(v)     for(auto i:v1){cout<<i<<" ";} cout<<endl;
  22.  
  23.  
  24.  
  25.  
  26. int32_t main(){
  27. fast
  28.     #ifndef ONLINE_JUDGE
  29.       freopen("input.txt","r",stdin);
  30.       freopen("output.txt","w",stdout);
  31.     #endif
  32.  
  33.  
  34.  
  35.  
  36. int t=1;
  37. // cin>>t;
  38. while(t--){
  39.   vector<int> nums{1,2,3,4,5};
  40.   int k = 3;
  41.  
  42.   unordered_map<int,int>mp;
  43.   int n = nums.size();
  44.  
  45.   for(int i=0;i<nums.size();i++){
  46.   	mp[nums[i]] = i;
  47.   }
  48.  
  49.   sort(nums.begin(),nums.end(),greater<int>());
  50.   for(int i=0;i<k;i++){
  51.   	cout<<mp[nums[i]]<<" ";
  52.   }
  53.   cout<<endl;
  54.  
  55.  
  56. }
  57. return 0;
  58. }
  59.  
Success #stdin #stdout 0.01s 5528KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
4 3 2
https://ideone.com/HsfiBf
language:
C++ (gcc 8.3)
created:
2 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!