제출 #650844

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
650844		edogawa_something	Utrka (COCI14_utrka)	C++14	80 / 80	154 ms	42872 KiB

utrka

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef string st;
typedef bool bl;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
typedef vector<pii> vpi;
#define pu push
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
#define fast ios_base::sync_with_stdio(0);cin.tie();
#define test ll qqqqq;cin>>qqqqq;while(qqqqq--)
#define F first
#define S second
#define forn(i,n) for(ll i=0;i<n;i++)
#define forx(i,j,n) for(ll i=j;i<n;i++)
#define pb push_back
#define pob pop_back
#define all(v) v.begin(),v.end()
#define lb lower_bound
#define ub upper_bound
#define pof pop_front
const ll dx[]{1,0,-1,0};
const ll dy[]{0,1,0,-1};
const ll inf=2e18;
const ll mod=1e9+7;
const ll M=1e6+1;
const ll MM=1002;
const ll MMM=101;
const ld pi=acos(-1);
const ll mod1=1000000321;
ll n,sum,a[M],b[M];
st name[M];
map<st,ll>mp;
int main(){
    fast
    cin>>n;
    forn(i,n){
        cin>>name[i];
        mp[name[i]]++;
    }
    forn(i,n){
        st s;
        cin>>s;
        mp[s]--;
    }
    forn(i,n){
        if(mp[name[i]]>0){
        cout<<name[i];
        return 0;
        }
    }
    return 0;
}

• Subtask 1: 80 / 80