fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. const int MaxN=2e5;
  5. int N, Q;
  6. int num[MaxN];
  7. int qry[MaxN];
  8. int idx[MaxN];
  9. int ans[MaxN];
  10.  
  11. bool comp(int lhs,int rhs){
  12. 	return qry[lhs]>qry[rhs];
  13. }
  14. int main(){
  15. 	cin>>N>>Q;
  16. 	for(int n=0; n<N; n+=1)
  17. 		cin>>num[n];
  18. 	for(int q=0; q<Q; q+=1)
  19. 		cin>>qry[q];
  20. 	//
  21. 	for(int q=0; q<Q; q+=1)
  22. 		idx[q]=q;
  23. 	sort(idx,idx+Q,comp);
  24. 	for(int q=0; q<Q; q+=1)
  25. 		cout<<N-idx[q]+1<<"\n";
  26. }
Success #stdin #stdout 0.01s 5612KB
comments (?)
stdin
copy 
3 1
100 160 130
120
stdout
copy 
4
https://ideone.com/wu2hGL
e864. Q3-2 循環小數
language:
C++ (gcc 8.3)
created:
12 days 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!