# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
662466 | 2022-11-26T09:54:43 Z | Kenpar | Autići (COCI22_autici) | C++17 | 19 ms | 1712 KB |
#include "bits/stdc++.h" using namespace std; #define ll long long #define endl '\n' const ll MOD = 1e9+7; const ll INF = 1e16; const ll MAX = 1e5; void solve(){ int n; cin>>n; vector<int> arr(n); for(int i = 0; i < n; i++){ cin>>arr[i]; } sort(arr.begin(), arr.end()); ll sum = 0; for(int i = 0; i < n; i++){ if(i == 0) sum+= arr[i]*(n-1); else sum+=arr[i]; } cout<<sum; } int main() { cin.tie(NULL); ios::sync_with_stdio(NULL); int t = 1; //cin>>t; int temp = t; while(t--){ //cout<<"Case #"<<temp - t<<" > "<<endl; solve(); cout<<endl; } cout.flush(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 6 ms | 852 KB | Output is correct |
3 | Incorrect | 19 ms | 1712 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Incorrect | 1 ms | 212 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 6 ms | 852 KB | Output is correct |
3 | Incorrect | 19 ms | 1712 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |