제출 #1318863

#제출 시각아이디문제언어결과실행 시간메모리
1318863discontinuousSafety (NOI18_safety)C++20
5 / 100
25 ms1848 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back #define int long long const int MOD = 1e9 + 7; const int INF = 1e15; const int N = 1e6; int n, m, k, a, b, c, d, h, l, r, q, u, v, x, y; void solve() { cin >> n >> h; vector<int> arr(n+1); h = 0; for(int i = 1; i<=n; i++) { cin >> arr[i]; h += arr[i]; } sort(arr.begin(), arr.end()); c = INF; x = 0; for(int i = 1; i<=n; i++) { // cout << x << "\n"; c = min(c, (i-1)*arr[i]-x + (h-x-arr[i])-(n-i)*arr[i]); x += arr[i]; } cout << c; } int32_t main() { ios::sync_with_stdio(false); cout.tie(0); cin.tie(0); int tc = 1; // cin >> tc; while(tc--) { solve(); cout << "\n"; } return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...