Submission #4261265
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define repe(i,n) rep(i,(n)+1) #define per(i,n) for(int i=(int)(n)-1;i>=0;i--) #define pere(i,n) rep(i,(n)+1) #define all(x) (x).begin(),(x).end() #define SP <<" "<< #define MOD 1000000007 #define IINF 1000000000 #define LINF 1000000000000000000 typedef long long LL; typedef long double LD; int main(){ int n; cin >> n; vector<pair<int,int>> a(n); for(int i=0;i<n;i++) cin >> a[i].first,a[i].second=i%2; sort(all(a)); int ans=0; for(int i=0;i<n;i+=2) ans+=a[i].second; cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - BBuBBBlesort! |
User | yamunaku |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 640 Byte |
Status | AC |
Exec Time | 47 ms |
Memory | 1152 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 600 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 47 ms | 1024 KB |
02.txt | AC | 47 ms | 1024 KB |
03.txt | AC | 47 ms | 1024 KB |
04.txt | AC | 47 ms | 1152 KB |
05.txt | AC | 36 ms | 1024 KB |
06.txt | AC | 36 ms | 1024 KB |
07.txt | AC | 36 ms | 1024 KB |
08.txt | AC | 31 ms | 1024 KB |
09.txt | AC | 31 ms | 1024 KB |
10.txt | AC | 31 ms | 1024 KB |
11.txt | AC | 31 ms | 1024 KB |
12.txt | AC | 31 ms | 1024 KB |
13.txt | AC | 31 ms | 1024 KB |
14.txt | AC | 36 ms | 1024 KB |
15.txt | AC | 36 ms | 1024 KB |
16.txt | AC | 36 ms | 1024 KB |
17.txt | AC | 37 ms | 1024 KB |
18.txt | AC | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |