fork download
  1. #include <iostream>
  2. #include <stdio.h>
  3.  
  4. using namespace std;
  5.  
  6. int minN(int x, int y) {
  7. if(x < y) {
  8. return x;
  9. }
  10. else {
  11. return y;
  12. }
  13. }
  14.  
  15. int main() {
  16. int tc = 0;
  17. scanf("%d", &tc);
  18. getchar();
  19.  
  20. for(int t = 1; t <= tc; t++) {
  21. int monster = 0;
  22. int level = 0;
  23. scanf("%d %d", &monster, &level);
  24.  
  25. int index = 0;
  26. int lowest = 109368294;
  27. char buang[1000];
  28.  
  29. for(int i = 1; i <= monster; i++) {
  30. int temp = 0;
  31. scanf("%d", &temp);
  32. if(temp == level) {
  33. lowest = level;
  34. index = i;
  35. scanf("%[^\n]", buang);
  36. getchar();
  37. break;
  38. }
  39. else if(temp < level) {
  40. if(lowest > minN(lowest, level - temp)) {
  41. index = i;
  42. }
  43. lowest = minN(lowest, level - temp);
  44. }
  45. else if(temp > level) {
  46. if(lowest > minN(lowest, temp - level)) {
  47. index = i;
  48. }
  49. lowest = minN(lowest, temp - level);
  50. }
  51. }
  52.  
  53. printf("Case #%d: ", t);
  54. printf("%d\n", index);
  55. }
  56.  
  57. return 0;
  58. }
Success #stdin #stdout 0s 4528KB
stdin
3
5 5
5 5 5 5 5
5 5
1 2 3 4 5
5 10
1 2 3 4 5
stdout
Case #1: 1
Case #2: 5
Case #3: 5