Comments

• 
  

  -1

  ducphong    2:39 p.m. 29 nov, 2024

  800 điểm free

• 
  

  1

  quan_vu1    10:02 p.m. 21 sep, 2024

  mình thấy có vẻ test hơi yếu, nếu chỉ sort như bình thường rồi in ra phần tử thứ k trong mảng đã sort thì AC cả bài, nhưng nếu làm vậy mà gặp trường hợp nhiều số giống nhau là đi luôn

• 
  

  0

  PY1ELeTrongNhan    10:06 p.m. 30 aug, 2023

  n, k=map(int, input().split())
  a=list(map(int, input().split()))
  a.sort()
  print(*a[k-1:k])

• 
  

  3

  ANHKIỆT9A    3:37 p.m. 12 aug, 2023

  dễ lám

  include <bits/stdc++.h>

  using namespace std;
  long long n,a[10000010],k,i;
  int main()
  {
  cin>>n>>k;
  for(i=1;i<=n;i++) cin>>a[i];
  sort (a+1,a+n+1);
  cout<<a[k];
  }

  1 reply
• 
  

  -5

  tranthanh05012011    8:07 p.m. 26 jul, 2023

  Sao nhiều donwnvote vậy ta?:)

  This comment is hidden due to too much negative feedback. Click here to view it.

• 
  

  -7

  HNHthcsyl    3:15 p.m. 6 jun, 2023 ← edited →

  MMBVL

  This comment is hidden due to too much negative feedback. Click here to view it.

• 
  

  -9

  chienthancontent    8:18 p.m. 19 may, 2023

  Test cùi vaiz

  This comment is hidden due to too much negative feedback. Click here to view it.

• 
  

  -10

  kienhc    11:03 a.m. 23 jul, 2021

  Cái ni làm bubble sort cux dc nè

  This comment is hidden due to too much negative feedback. Click here to view it.

• 
  

  -45

  n3nhannxt    9:14 p.m. 3 aug, 2020

  Code Tham Khảo.

  include<bits/stdc++.h>

  int main()
  {
  long long a[10001],n,k;

  scanf("%lld%lld",&n,&k);
  for(int i=1;i<=n;i++)
  {
     scanf("%lld",&a[i]);
  }
  for(int i=1;i<n;i++)
      for(int j=1;j<=n-i;j++)
  {
           if(a[j]>a[j+1])
          std::swap(a[j],a[j+1]);
  }
  

  printf("%lld ",a[k]);
  }

  This comment is hidden due to too much negative feedback. Click here to view it.

  1 reply