8000 [23-02-01] seungyeon.py by seungueonn · Pull Request #41 · da-in/algorithm-study · GitHub
[go: up one dir, main page]
Skip to content

[23-02-01] seungyeon.py #41

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Merged
merged 3 commits into from
Feb 1, 2023
Merged

[23-02-01] seungyeon.py #41

merged 3 commits into from
Feb 1, 2023

Conversation

seungueonn
Copy link
Collaborator

PR Summary

K번째 수

  • 배열을 자르고 잘라 풀었습니다.

더 맵게

  • heap을 이용해 heap[0]값을 K와 비교하며 반복문을 끝내고자 했습니다.

가장 큰 수

  • 싫어요
  • permutation 사용해서 여러 숫자 만든다음 정렬해서 가장 큰 수로 하기 -> 시간초과
  • dfs로 가장 큰 수 빨리 찾기 -> 시간초과
  • ???????? 생각이 안나요 ..

ISSUE NUMBER

@seungueonn seungueonn added help wanted Extra attention is needed heap sort labels Jan 31, 2023
@seungueonn seungueonn self-assigned this Jan 31, 2023
@seungueonn seungueonn merged commit 50daf47 into da-in:main Feb 1, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@da-in da-in Awaiting requested review from da-in da-in is a code owner

@Lee-DoHa Lee-DoHa Awaiting requested review from Lee-DoHa

@lalabulla lalabulla Awaiting requested review from lalabulla lalabulla is a code owner

@chs98412 chs98412 Awaiting requested review from chs98412 chs98412 is a code owner

Assignees

@seungueonn seungueonn

Labels
heap help wanted Extra attention is needed sort
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@seungueonn
0