# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
211945 | 2020-03-21T19:40:55 Z | tleontest1 | Akcija (COCI15_akcija) | C++14 | 28 ms | 1664 KB |
#pragma GCC optimize ("O3") #pragma GCC target ("sse4") #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define int long long #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo MAX = -1000000000000000000; const lo MIN = 1000000000000000000; const lo inf = 1000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t; int cev; string s; vector<int> v; main(void){ scanf("%lld",&n); FOR{ scanf("%lld",&a[i]); } sort(a+1,a+n+1); reverse(a+1,a+n+1); FOR{ if(i+2>n){cev+=a[i];continue;} cev+=a[i]; cev+=a[i+1]; i+=2; } printf("%lld\n",cev); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 5 ms | 384 KB | Output is correct |
5 | Correct | 5 ms | 256 KB | Output is correct |
6 | Correct | 24 ms | 1536 KB | Output is correct |
7 | Correct | 22 ms | 1664 KB | Output is correct |
8 | Correct | 18 ms | 1528 KB | Output is correct |
9 | Correct | 28 ms | 1664 KB | Output is correct |
10 | Correct | 28 ms | 1660 KB | Output is correct |