#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define vll vector<ll>
#define vii vector<pair<int,int>>
#define vlll vector<pair<ll,ll>>
#define all(x) x.begin(),x.end()
#define TESTCASES ll t;cin>>t;while(t--)
using namespace std;
int main()
{
ll n;cin>>n;string s;map<string,ll> cnt;
for(int i=1;i<=2*n-1;i++)
{cin>>s;cnt[s]++;}
for(auto x:cnt)
{if(x.second%2){cout<<x.first;return 0;}}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
2 ms |
364 KB |
Output is correct |
5 |
Correct |
2 ms |
364 KB |
Output is correct |
6 |
Correct |
109 ms |
5356 KB |
Output is correct |
7 |
Correct |
189 ms |
7916 KB |
Output is correct |
8 |
Correct |
237 ms |
9580 KB |
Output is correct |
9 |
Correct |
284 ms |
10348 KB |
Output is correct |
10 |
Correct |
258 ms |
10348 KB |
Output is correct |