Submission #13724

#	Time	Username	Problem	Language	Result	Execution time	Memory
13724		gs14004	즐거운 채소 기르기 (JOI14_growing)	C++14	45 / 100	209 ms	1084 KiB

growing

#include <cstdio>
#include <algorithm>
using namespace std;

int main(){
    int n,a[5005];
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        scanf("%d",&a[i]);
    }
    int ret = 0;
    for (int i=0; i<n; i++) {
        int p = (int)(min_element(a,a+n) - a);
        int cnt1 = 0, cnt2 = 0;
        for (int i=0; i<p; i++) {
            if(a[i] <= 1e9 && a[i] > a[p]) cnt1++;
        }
        for (int i=p+1; i<n; i++) {
            if(a[i] <= 1e9 && a[i] > a[p]) cnt2++;
        }
        a[p] = 2e9;
        ret += min(cnt1,cnt2);
    }
    printf("%d",ret);
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 15 / 15
• Subtask 4: 0 / 55