8000 Merge pull request #268 from diyamea/develop · spy03128/basic-algo-lecture@0e403e5 · GitHub
[go: up one dir, main page]

Skip to content

Commit 0e403e5

Browse files
Merge pull request encrypted-def#268 from diyamea/develop
boj 13414 solution
2 parents 816221b + ba1e0c9 commit 0e403e5

File tree

1 file changed

+28
-4
lines changed

1 file changed

+28
-4
lines changed

0x15/solutions/13414.cpp

Lines changed: 28 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,35 @@
1-
// Authored by : BaaaaaaaaaaarkingDog
2-
// Co-authored by : -
3-
// http://boj.kr/****************
1+
// Authored by : diyamea
2+
// Co-authored by : BaaaaaaaaaaarkingDog
3+
// http://boj.kr/848301746aac4a92872d58a8a5e8d596
44
#include <bits/stdc++.h>
55
using namespace std;
66

7+
#define X first
8+
#define Y second
9+
710
int main(void){
811
ios::sync_with_stdio(0);
912
cin.tie(0);
1013

11-
}
14+
int k,l;
15+
cin >> k >> l;
16+
unordered_map<string, int> signup{};
17+
for(int i=0; i<l; ++i) {
18+
string student_num;
19+
cin >> student_num;
20+
if(signup.find(student_num) != signup.end()) {
21+
signup.erase(student_num);
22+
signup[student_num] = i;
23+
}
24+
else
25+
signup[student_num] = i;
26+
}
27+
vector<pair<string,int>> slist (signup.begin(), signup.end());
28+
// 이 문법이 익숙하지 않으면 익명 함수 or 람다 식 검색
29+
sort(slist.begin(), slist.end(), [](auto& a, auto& b) { return a.Y < b.Y;});
30+
31+
int en = min(k, (int)slist.size());
32+
33+
for(int i = 0; i < en; ++i)
34+
cout << slist[i].X << '\n';
35+
}

0 commit comments

Comments
 (0)
0