fork(1) download
copy 
  1. #include<stdio.h>
  2. #include<iostream>
  3. #include<cstring>
  4. #include<algorithm>
  5. #include<bits/stdc++.h>
  6. #include<cmath>
  7. #define f(i,x) for(i=0;i<x;i++)
  8. #define sc(x) scanf("%d",&x)
  9. #define sc1(x) scanf("%lld",&x)
  10. #define pb push_back
  11. #define mp make_pair
  12. #define fi first
  13. #define se second
  14. #define mod 1000000007
  15. #define set(v) v.begin(),v.end()
  16. #define pc(x) printf("%d\n",x)
  17. #define pc2(x) printf("%d ",x)
  18. #define pc1(x) printf("%lld\n",x)
  19. using namespace std;
  20. int main(){
  21. long m,n,t;
  22. int p,i,j,p1=0;
  23. vector<long>arr;
  24. vector<long>arr1;
  25. scanf("%ld",&m);
  26. while(m--){
  27. 	scanf("%ld",&n);
  28. 	arr.pb(n);	
  29. }
  30. sc(p);
  31. for(i=0;i<p;i++)
  32. {
  33. if(i==0)
  34. {
  35. scanf("%ld",&t);
  36. arr1.pb(t-1);
  37. printf("%ld\n",arr[t-1]);
  38. }
  39. else{
  40. 	scanf("%ld",&t);
  41. 	sort(arr1.begin(),arr1.end());
  42. 	for(j=0;j<arr1.size();j++){
  43. 		if(arr1[j]<=p1+t-1)
  44. 		p1++;
  45. 	}
  46. 	/*int p2=0;
  47. 	if(p1!=0)
  48. 	for(j=0;j<arr1.size();j++){
  49. 		if(arr1[j]<=t+p1-1&&arr1[j]>t-1)
  50. 		p1++;
  51. 	}
  52. 	p1=p1+p2;*/
  53. 	arr1.pb(t+p1-1);
  54. 	printf("%ld\n",arr[t+p1-1]);
  55. 	p1=0;//p2=0;
  56. }
  57. }
  58. 	return 0;
  59. }
Success #stdin #stdout 0s 3436KB
comments (?)
stdin
copy 
5
26 1 42 15 3 
2
3
4
stdout
copy 
42
3
https://ideone.com/zjshg7
language:
C++ (gcc 8.3)
created:
9 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!