Submission #532092

#TimeUsernameProblemLanguageResultExecution timeMemory
532092andecaandeciBest Place (NOI17_bestplace)C++17
48 / 100
88 ms2968 KiB
#include <bits/stdc++.h> #define pb push_back #define fi first #define se second typedef long long ll; using namespace std; ll n, X[100005], Y[100005]; int main(){ //subtask 2 cin >> n; for(int i = 0; i < n; i++){ cin >> X[i] >> Y[i]; } sort(X,X+n); ll ans = X[n/2]; cout << ans << " 0" << endl; }
#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...