제출 #545301

#제출 시각아이디문제언어결과실행 시간메모리
545301Trisanu_DasBest Place (NOI17_bestplace)C++17
3 / 100
77 ms3000 KiB
#include <bits/stdc++.h> using namespace std; #define ff first #define ss second int main(){ int n; cin >> n; pair<int, int> arr[n]; for(int i = 0; i < n; i++) cin >> arr[i].ff >> arr[i].ss; if(n == 2){ cout << arr[0].ff << ' ' << arr[0].ss << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...