# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
709014 | 2023-03-13T04:07:01 Z | vjudge1 | Akcija (COCI15_akcija) | C++17 | 17 ms | 1264 KB |
#include <bits/stdc++.h> using namespace std; // #pragma comment(linker, "/stack:2000000000") // #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll,ll> pll; #define precise(a) cout<<fixed<<setprecision(a) #define sz size() #define ff first #define ss second #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(), a.rend() #define pb push_back // t1 const ll mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6 const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod const ll N = ll(1e6)+10; const ll K = 17; const ll inf = 4e18; const ld eps = 1e-15L; // const ll B = 316; // const ld pie = acos(-1.0); ll lcm(ll a, ll b){ return (a / __gcd(a,b))*b; } ll binpow(ll a, ll b, ll m){ ll res=1;a%=m; while(b>0){ if(b&1)res=(res*a)%m; a=(a*a)%m; b/=2; } return res%m;} void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); } void precalc() { } void Baizho() { ll n; cin>>n; ll a[n+11]; for(ll i=1; i<=n; i++) cin>>a[i]; sort(a+1, a+n+1, greater<ll>()); ll ans = 0; for(ll i=1; i<=n; i++) { if(i%3!=0) ans+=a[i]; } cout<<ans; } int main() { // Freopen("div7"); ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); precalc(); int ttt = 1; // cin>>ttt; for(int i=1; i<=ttt; i++) {Baizho(); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 13 ms | 1136 KB | Output is correct |
7 | Correct | 9 ms | 1236 KB | Output is correct |
8 | Correct | 8 ms | 1180 KB | Output is correct |
9 | Correct | 15 ms | 1236 KB | Output is correct |
10 | Correct | 17 ms | 1264 KB | Output is correct |