CodeLabs

#include #include #include #include #define pp pair using namespace std; int n, m, idx = 0; string str; map mm; map answer; bool compare(const pp& a, const pp& b) { if (a.second == b.second) return a.first > n >> m; for (int i = 0; i > str; mm[str] = true; } for (int i = 0; i > str; if (mm[str]) { answer..

using System; using System.Collections.Generic; using System.Linq; struct Locate { public int location, time; public Locate(int location,int time) { this.location = location; this.time = time; } } class Program { static int[] N_K = Console.ReadLine().Split().Select(int.Parse).ToArray(); static int n = N_K[0], k = N_K[1]; static bool[] visited = new bool[100001]; static Queue lot = new Queue(); s..

#include #include #include using namespace std; string input; map name; map num; int main() { ios::ios_base::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; for (int i = 1; i > input; name[input] = i; num[i] = input; } for (int i = 0; i > input; if (name[input] != NULL) cout

추가 제거 찾기 정렬

Sort public class Part : IEquatable, IComparable { public int Id; public string Name; public Part(int id, string name) { Id = id; Name = name; } public int SortByNameAscending(string name1, string name2) { return name1.CompareTo(name2); } public int CompareTo(Part comparePart) { if (comparePart == null) return 1; else return Id.CompareTo(comparePart.Id); } public bool Equals(Part? other) { if (o..

using System; class Program { static string[] str; static int result = 0; static void Input() { str = Console.ReadLine().Split('-'); } static void Solution() { Division(); for(int i=1; i