fork download
  1. #include<stdio.h>
  2. #include<algorithm>
  3. #include<iostream>
  4. using namespace std;
  5.  
  6.  
  7.  
  8.  
  9.  
  10.  
  11.  
  12.  
  13.  
  14. int main()
  15. {
  16. int tc, kali, data; int temp, awal, akhir, datake;
  17. long long int angka[10005], angkatemp[1005]={0},count=0;
  18. scanf("%d", &tc);getchar();
  19. for(int i =0 ; i < tc; i++)
  20. {
  21. scanf("%d %d", &data, &kali);
  22.  
  23. for(int k = 0 ; k < data; k++)
  24. {
  25. scanf(" %d", &angka[k]);getchar();
  26. }
  27.  
  28.  
  29.  
  30. for(int j = 0 ; j < kali; j++)
  31. {
  32. scanf("%d %d %d", &awal, &akhir, &datake);getchar();
  33. count=0;
  34. for(int a =awal-1; a<akhir; a++)
  35. {
  36. angkatemp[count] = angka[a];
  37. count++;
  38. }
  39. sort(angkatemp, angkatemp+count);
  40.  
  41. if(j == 0)
  42. {
  43. printf("Case #%d:\n",i+1);
  44. }
  45. if(j == kali-1 && i == tc-1)
  46. printf("%d",angkatemp[datake-1]);
  47. else
  48. printf("%d\n",angkatemp[datake-1]);
  49.  
  50.  
  51. }
  52. }
  53.  
  54. return 0;
  55. }
Success #stdin #stdout 0.01s 5284KB
stdin
1
100 1 
1000000000 1 2 90000000 12345678 87654321 23456789 98765432 45678901 10987654 1000000000 1 2 90000000 12345678 87654321 23456789 98765432 45678901 10987654 1000000000 1 2 90000000 12345678 87654321 23456789 98765432 45678901 10987654 1000000000 1 2 90000000 12345678 87654321 23456789 98765432 45678901 10987654 1000000000 1 2 90000000 12345678 87654321 23456789 98765432 45678901 10987654 1000000000 1 2 90000000 12345678 87654321 23456789 98765432 45678901 10987654 1000000000 1 2 90000000 12345678 87654321 23456789 98765432 45678901 10987654 1000000000 1 2 90000000 12345678 87654321 23456789 98765432 45678901 10987654 1000000000 1 2 90000000 12345678 87654321 23456789 98765432 45678901 10987654 1000000000 1 2 90000000 12345678 87654321 23456789 98765432 45678901 10987654
1 100 3
stdout
Case #1:
1