| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 545298 | Trisanu_Das | Best Place (NOI17_bestplace) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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';
}
}