| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1152068 | m.inggg | Best Place (NOI17_bestplace) | C++17 | 11 ms | 440 KiB |
#include <bits/stdc++.h>
#define vi vector<int>
#define int long long
#define fi first
#define se second
using namespace std;
void solve(){
int n; cin >> n;
int tx = 0;
int ty = 0;
for(int i = 0;i < n ;i++){
int x,y;
cin >> x >> y;
tx += x;
ty += y;
}
int totx = tx/n;
int toty = ty/n;
cout << totx << ' ' << toty;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
solve();
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
