제출 #471362

#제출 시각아이디문제언어결과실행 시간메모리
471362grimzzz404Best Place (NOI17_bestplace)C++17
0 / 100
27 ms380 KiB
/** * Author: grimzzz-404 **/ #include <bits/stdc++.h> using namespace std; #define FOR(x) for (int i = 0; i < (x); ++i) #define FOR_(x,y) for (int i = (x); i < (y); ++i) #define watch(x) cout << (#x) << " is " << (x) << endl #define vi vector<int> #define ll long long #define ld long double #define pb push_back #define ppb pop_back #define p push #define pp pop #define mp make_pair #define f first #define s second #define all(x) (x).begin(), (x).end() #define sz(x) (x).size #define endl '\n' void solve(); int main() { ios::sync_with_stdio(false); cin.tie(0); int t = 1; //cin >> t; FOR(t) { //cout << "Test Case #" << i + 1 << '\n'; solve(); } return 0; } void solve() { int n; cin >> n; int one,two; int ans = 0, ans1 = 0; for (int i = 0; i < n; i++) { cin >> one >> two; ans+=one; ans1+=two; } //bug cout << ceil(ans/n) << " " << ceil(ans1/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...