-
Notifications
You must be signed in to change notification settings - Fork 0
9-Kaifeel #39
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.
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
Open
Kaifeel
wants to merge
1
commit into
main
Choose a base branch
from
9-Kaifeel
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
+62
−0
Open
9-Kaifeel #39
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,60 @@ | ||
| #include <iostream> | ||
| #include <vector> | ||
| #include <algorithm> | ||
| #include <climits> | ||
|
|
||
| using namespace std; | ||
| typedef long long ll; | ||
|
|
||
| int main() | ||
| { | ||
| int n; | ||
| cin >> n; | ||
| vector<ll> plus; | ||
|
|
||
| vector<ll> minus; | ||
|
|
||
| while (n--) | ||
| { | ||
| ll num; | ||
| cin >> num; | ||
| if (num > 0) | ||
| plus.push_back(num); | ||
| else | ||
| minus.push_back(num); | ||
| } | ||
|
|
||
| sort(plus.begin(), plus.end()); | ||
| sort(minus.rbegin(), minus.rend()); | ||
|
|
||
| int i = 0, j = 0; | ||
| ll ans = 0; | ||
| ll cur = 0; | ||
|
|
||
| while (i != minus.size() || j != plus.size()) | ||
| { | ||
|
|
||
| ll leftD = LLONG_MAX; | ||
| ll rightD = LLONG_MAX; | ||
|
|
||
| if (i < minus.size()) | ||
| leftD = abs(minus[i] - cur); | ||
| if (j < plus.size()) | ||
| rightD = abs(plus[j] - cur); | ||
|
|
||
| if (leftD <= rightD) | ||
| { | ||
| ans += leftD; | ||
| cur = minus[i]; | ||
| i++; | ||
| } | ||
| else | ||
| { | ||
| ans += rightD; | ||
| cur = plus[j]; | ||
| j++; | ||
| } | ||
| } | ||
|
|
||
| cout << ans; | ||
| } | ||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
수고하셨습니다!
longlong_max를 사용하신 이유가
왼쪽이나 오른쪽에 더 이상 후보가 없는 경우 엄청 큰 값을 넣어 둬서 이후 거리 비교 때 반대쪽이 선택 되도록 하신 건가요??